Loading [MathJax]/jax/output/CommonHTML/jax.js
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

SEARCH GUIDE  Download Search Tip PDF File

  • articleNo Access

    SPECIAL SOLUTION STRATEGIES INSIDE A SPECTRAL ELEMENT OCEAN MODEL

    We present three ideas to accelerate the filtering process used in the multilayered Spectral Element Ocean Model (SEOM). We define and analyze a Schur complement preconditioner, a lumping of small entries and an algebraic multigrid (AMG) algorithm. and a algebraic multigrid with patch smoothing algorithm. Finally, we analyze the impact of variations of the Schur complement and AMG methods on memory and computer time.

  • articleNo Access

    ALGEBRAIC WAY TO DERIVE ABSORBING BOUNDARY CONDITIONS FOR THE HELMHOLTZ EQUATION

    This paper is dedicated to the optimal convergence properties of a domain decomposition method involving two-Lagrange multipliers at the interface between the subdomains and additional augmented interface operators. Most methods for optimizing these augmented interface operators are based on the discretization of continuous approximations of the optimal transparent operators.1–5 Such approach is strongly linked to the continuous equation, and to the discretization scheme. At the discrete level, the optimal transparent operator can be proved to be equal to the Schur complement of the outer subdomain. Our idea consists of approximating directly the Schur complement matrix with purely algebraic techniques involving local condensation of the subdomain degree of freedom on small patch defined on the interface between the subdomains. The main advantage of such approach is that it is much more easy to implement in existing code without any information on the geometry of the interface and of the finite element formulation used. Such technique leads to a so-called "black box" for the users. Convergence results and parallel efficiency of this new and original algebraic optimization technique of the interface operators are presented for acoustics applications.

  • articleNo Access

    Resistance distances in corona and neighborhood corona networks based on Laplacian generalized inverse approach

    Let G1 and G2 be two graphs on disjoint sets of n1 and n2 vertices, respectively. The corona of graphs G1 and G2, denoted by G1G2, is the graph formed from one copy of G1 and n1 copies of G2 where the ith vertex of G1 is adjacent to every vertex in the ith copy of G2. The neighborhood corona of G1 and G2, denoted by G1G2, is the graph obtained by taking one copy of G1 and n1 copies of G2 and joining every neighbor of the ith vertex of G1 to every vertex in the ith copy of G2 by a new edge. In this paper, the Laplacian generalized inverse for the graphs G1G2 and G1G2 is investigated, based on which the resistance distances of any two vertices in G1G2 and G1G2 can be obtained. Moreover, some examples as applications are presented, which illustrate the correction and efficiency of the proposed method.

  • articleNo Access

    The existence and representation of the Drazin inverse of a 2×2 block matrix over a ring

    In this paper, further results on the Drazin inverse are obtained in a ring. Several representations of the Drazin inverse of 2×2 block matrices over an arbitrary ring are given under new conditions. Also, upper bounds for the Drazin index of block matrices are studied. Numerical examples are given to illustrate our results. Necessary and sufficient conditions for the existence as well as the expression of the group inverse of block matrices are obtained under certain conditions. In particular, some results of related papers which were considered for complex matrices, operator matrices and matrices over a skew field are extended to more general setting.

  • articleOpen Access

    Revising the Boundary Element Method for Thermoviscous Acoustics: An Iterative Approach via Schur Complement

    The Helmholtz equation is a reliable model for acoustics in inviscid fluids. Real fluids, however, experience viscous and thermal dissipation that impact the sound propagation dynamics. The viscothermal losses primarily arise in the boundary region between the fluid and solid, the acoustic boundary layers. To preserve model accuracy for structures housing acoustic cavities of comparable size to the boundary layer thickness, meticulous consideration of these losses is essential. Recent research efforts aim to integrate viscothermal effects into acoustic boundary element methods (BEM). While the reduced discretization of BEM is advantageous over finite element methods, it results in fully populated system matrices whose conditioning deteriorates when extended with additional degrees of freedom to account for viscothermal dissipation. Solving such a linear system of equations becomes prohibitively expensive for large-scale applications, as only direct solvers can be used. This work proposes a revised formulation for the viscothermal BEM employing the Schur complement and a change of basis for the boundary coupling. We demonstrate that static condensation significantly improves the conditioning of the coupled problem. When paired with an iterative solution scheme, the approach lowers the algorithmic complexity and thus reduces the computational costs in terms of runtime and storage requirements. The results demonstrate the favorable performance of the new method, indicating its usability for applications of practical relevance in thermoviscous acoustics.

  • chapterNo Access

    Matrix Tricks for Linear Statistical Models: A Short Review of our Personal Top Fourteen

    In teaching a course in linear statistical models to first year graduate students or to final year undergraduate students, say, there is no way to proceed smoothly without matrices and related concepts of linear algebra; their use is really essential. Our experience is that making some particular matrix tricks familiar to students can increase their insight into linear statistical models (and also multivariate statistical analysis). In matrix algebra, there are handy, sometimes even very simple "tricks" to simplify and clarify the problem treatment — both for the student and for the researcher. Of course, the concept of trick is not uniquely defined: by trick we simply mean here a central important handy result. In this paper we collect together our Top Fourteen favourite matrix tricks for linear statistical models. We merely state our tricks with some references; a more comprehensive report including proofs, examples and full references is in progress [see Isotalo, Puntanen &, Styan (2005)].

  • chapterNo Access

    SELF-ADJOINTNESS VIA PARTIAL HARDY-LIKE INEQUALITIES

    Distinguished selfadjoint extensions of operators which are not semibounded can be deduced from the positivity of the Schur Complement (as a quadratic form). In practical applications this amounts to proving a Hardy-like inequality. Particular cases are Dirac-Coulomb operators where distinguished selfadjoint extensions are obtained for the optimal range of coupling constants.