Search results for "Preconditioner"

showing 10 items of 11 documents

A Domain Imbedding Method with Distributed Lagrange Multipliers for Acoustic Scattering Problems

2003

The numerical computation of acoustic scattering by bounded twodimensional obstacles is considered. A domain imbedding method with Lagrange multipliers is introduced for the solution of the Helmholtz equation with a second-order absorbing boundary condition. Distributed Lagrange multipliers are used to enforce the Dirichlet boundary condition on the scatterer. The saddle-point problem arising from the conforming finite element discretization is iteratively solved by the GMRES method with a block triangular preconditioner. Numerical experiments are performed with a disc and a semi-open cavity as scatterers.

symbols.namesakeConstraint algorithmHelmholtz equationDiscretizationPreconditionerLagrange multiplierDirichlet boundary conditionMathematical analysissymbolsBoundary value problemFinite element methodMathematics
researchProduct

A damping preconditioner for time-harmonic wave equations in fluid and elastic material

2009

A physical damping is considered as a preconditioning technique for acoustic and elastic wave scattering. The earlier preconditioners for the Helmholtz equation are generalized for elastic materials and three-dimensional domains. An algebraic multigrid method is used in approximating the inverse of damped operators. Several numerical experiments demonstrate the behavior of the method in complicated two-dimensional and three-dimensional domains. peerReviewed

Algebraic multigrid methodPhysics and Astronomy (miscellaneous)Helmholtz equationGMRESNavier equationMathematics::Numerical AnalysisMultigrid methodHelmholtz equationäärellisten elementtien menetelmäMathematicsElastic scatteringNumerical AnalysisNavierin yhtälöPreconditionerApplied MathematicsMathematical analysispohjustinAcoustic waveWave equationAlgebrallinen multigrid-menetelmäHelmholzin yhtälöGeneralized minimal residual methodComputer Science::Numerical AnalysisFinite element methodComputer Science ApplicationselementtimenetelmäComputational MathematicsClassical mechanicsModeling and SimulationPreconditioner
researchProduct

An algebraic multigrid based shifted-Laplacian preconditioner for the Helmholtz equation

2007

A preconditioner defined by an algebraic multigrid cycle for a damped Helmholtz operator is proposed for the Helmholtz equation. This approach is well suited for acoustic scattering problems in complicated computational domains and with varying material properties. The spectral properties of the preconditioned systems and the convergence of the GMRES method are studied with linear, quadratic, and cubic finite element discretizations. Numerical experiments are performed with two-dimensional problems describing acoustic scattering in a cross-section of a car cabin and in a layered medium. Asymptotically the number of iterations grows linearly with respect to the frequency while for lower freq…

Algebraic multigrid methodPhysics and Astronomy (miscellaneous)Helmholtz equationGMRESMathematics::Numerical Analysissymbols.namesakeMultigrid methodQuadratic equationHelmholtz equationäärellisten elementtien menetelmäMathematicsNumerical AnalysisPreconditionerApplied MathematicspohjustinMathematical analysisAlgebrallinen multigrid-menetelmäHelmholzin yhtälöComputer Science::Numerical AnalysisGeneralized minimal residual methodFinite element methodComputer Science ApplicationselementtimenetelmäComputational MathematicsModeling and SimulationHelmholtz free energysymbolsPreconditionerLaplace operatorJournal of Computational Physics
researchProduct

Convergence of iterative methods in perturbation theory

1995

We discuss iterative KAM type methods for eigenvalue problems in finite dimensions. We compare their convergence properties with those of straight forward power series expansions.

Inverse iterationPower seriesSingular perturbationsymbols.namesakeIterative methodPreconditionerConvergence (routing)Mathematical analysissymbolsPerturbation theoryPoincaré–Lindstedt methodMathematics
researchProduct

A second-order sparse factorization method for Poisson's equation with mixed boundary conditions

1992

Abstract We propose an algorithm for solving Poisson's equation on general two-dimensional regions with an arbitrary distribution of Dirichlet and Neumann boundary conditions. The algebraic system, generated by the five-point star discretization of the Laplacian, is solved iteratively by repeated direct sparse inversion of an approximating system whose coefficient matrix — the preconditioner — is second-order both in the interior and on the boundary. The present algorithm for mixed boundary value problems generalizes a solver for pure Dirichlet problems (proposed earlier by one of the authors in this journal (1989)) which was found to converge very fast for problems with smooth solutions. T…

Fast solverPreconditionerfactorization methodApplied MathematicsMathematical analysisBoundary (topology)Dirichlet and Neumann conditionsMixed boundary conditionPreconditioned Conjugate Gradient methodComputational Mathematicssymbols.namesakeDirichlet boundary conditionConjugate gradient methodgeneral regionsNeumann boundary conditionsymbolsBoundary value problemPoisson's equationMathematicsJournal of Computational and Applied Mathematics
researchProduct

Fictitious Domain Methods for the Numerical Solution of Two-Dimensional Scattering Problems

1998

Fictitious domain methods for the numerical solution of two-dimensional scattering problems are considered. The original exterior boundary value problem is approximated by truncating the unbounded domain and by imposing a nonreflecting boundary condition on the artificial boundary. First-order, second-order, and exact nonreflecting boundary conditions are tested on rectangular and circular boundaries. The finite element discretizations of the corresponding approximate boundary value problems are performed using locally fitted meshes, and the discrete equations are solved with fictitious domain methods. A special finite element method using nonmatching meshes is considered. This method uses …

Numerical AnalysisPhysics and Astronomy (miscellaneous)Fictitious domain methodPreconditionerApplied MathematicsMathematical analysisBoundary (topology)Domain decomposition methodsDomain (mathematical analysis)Finite element methodComputer Science ApplicationsComputational MathematicsModeling and SimulationBoundary value problemInvariant (mathematics)MathematicsJournal of Computational Physics
researchProduct

Comparison between the shifted-Laplacian preconditioning and the controllability methods for computational acoustics

2010

Processes that can be modelled with numerical calculations of acoustic pressure fields include medical and industrial ultrasound, echo sounding, and environmental noise. We present two methods for making these calculations based on Helmholtz equation. The first method is based directly on the complex-valued Helmholtz equation and an algebraic multigrid approximation of the discretized shifted-Laplacian operator; i.e. the damped Helmholtz operator as a preconditioner. The second approach returns to a transient wave equation, and finds the time-periodic solution using a controllability technique. We concentrate on acoustic problems, but our methods can be used for other types of Helmholtz pro…

Algebraic multigrid methodFinite element methodHelmholtz equationPreconditionerSpectral element methodApplied MathematicsSpectral element methodMathematical analysisExact controllabilityComputational acousticsFinite element methodControllabilitysymbols.namesakeComputational MathematicsMultigrid methodHelmholtz free energysymbolsHelmholtz equationPreconditionerLaplace operatorMathematicsJournal of Computational and Applied Mathematics
researchProduct

Rank structured approximation method for quasi--periodic elliptic problems

2016

We consider an iteration method for solving an elliptic type boundary value problem $\mathcal{A} u=f$, where a positive definite operator $\mathcal{A}$ is generated by a quasi--periodic structure with rapidly changing coefficients (typical period is characterized by a small parameter $\epsilon$) . The method is based on using a simpler operator $\mathcal{A}_0$ (inversion of $\mathcal{A}_0$ is much simpler than inversion of $\mathcal{A}$), which can be viewed as a preconditioner for $\mathcal{A}$. We prove contraction of the iteration method and establish explicit estimates of the contraction factor $q$. Certainly the value of $q$ depends on the difference between $\mathcal{A}$ and $\mathcal…

Discrete mathematicsNumerical AnalysisRank (linear algebra)PreconditionerApplied Mathematicsprecondition methodsguaranteed error boundsOrder (ring theory)65F30 65F50 65N35 65F10tensor type methods010103 numerical & computational mathematicsNumerical Analysis (math.NA)elliptic problems with periodic and quasi-periodic coefficients01 natural sciencesFinite element method010101 applied mathematicsComputational MathematicsOperator (computer programming)Simple (abstract algebra)FOS: MathematicsBoundary value problemTensorMathematics - Numerical Analysis0101 mathematicsMathematics
researchProduct

A fast dual boundary element method for 3D anisotropic crack problems

2009

In the present paper a fast solver for dual boundary element analysis of 3D anisotropic crack problems is formulated, implemented and tested. The fast solver is based on the use of hierarchical matrices for the representation of the collocation matrix. The admissible low rank blocks are computed by adaptive cross approximation (ACA). The performance of ACA against the accuracy of the adopted computational scheme for the evaluation of the anisotropic kernels is investigated, focusing on the balance between the kernel representation accuracy and the accuracy required for ACA. The system solution is computed by a preconditioned GMRES and the preconditioner is built exploiting the hierarchical …

Numerical AnalysisMathematical optimizationCollocationRank (linear algebra)PreconditionerApplied MathematicsGeneral EngineeringDegrees of freedom (statistics)SolverGeneralized minimal residual methodMatrix (mathematics)Applied mathematicsBoundary element methodMathematicsInternational Journal for Numerical Methods in Engineering
researchProduct

Order optimal preconditioners for fully implicit Runge-Kutta schemes applied to the bidomain equations

2010

The partial differential equation part of the bidomain equations is discretized in time with fully implicit Runge–Kutta methods, and the resulting block systems are preconditioned with a block diagonal preconditioner. By studying the time-stepping operator in the proper Sobolev spaces, we show that the preconditioned systems have bounded condition numbers given that the Runge–Kutta scheme is A-stable and irreducible with an invertible coefficient matrix. A new proof of order optimality of the preconditioners for the one-leg discretization in time of the bidomain equations is also presented. The theoretical results are verified by numerical experiments. Additionally, the concept of weakly po…

Numerical AnalysisPartial differential equationDiscretizationPreconditionerApplied MathematicsMathematical analysisBlock matrixComputer Science::Numerical AnalysisMathematics::Numerical Analysislaw.inventionSobolev spaceComputational MathematicsRunge–Kutta methodsInvertible matrixlawCoefficient matrixAnalysisMathematicsNumerical Methods for Partial Differential Equations
researchProduct