# Preconditionning Techniques for the Solution of the Helmholtz Equation by the Finite Element Method

@inproceedings{Kechroud2003PreconditionningTF,
title={Preconditionning Techniques for the Solution of the Helmholtz Equation by the Finite Element Method},
booktitle={ICCSA},
year={2003}
}
• Published in ICCSA 1 December 2003
• Education
• I. T. Distinguished Professor, University of Minnesota, Department of Computer Science, May 2005 – present. • Professor, University of Minnesota, Department of Computer Science, Nov. 1990– present. • Head of the department of Computer Science and Engineering, University of Minnesota. Jan 1997 – June 2000. • Senior Scientist, Research Institute for Advanced Computer Science (RIACS), Jul. 1988–Nov. 1990. • Senior Computer Scientist, Center for Supercomputing Research and Development (CSRD) and…
4 Citations

### An improved axisymmetric Convected Boundary Element Method formulation with uniform flow

This paper presents an improved form of the convected Boundary Element Method (BEM) for axisymmetric problems in a subsonic uniform flow. The proposed formulation based on the axisymmetric Convected

### BEM Formulation for axisymmetric acoustic problems

In this paper, I develop a boundary element method for axisymmetric acoustic radiation and propagation problems in a subsonic uniform flow. This formulation uses the axisymmetric convected Green's

### Approximate Analyzing of Labeled Transition Systems

• Computer Science
• 2015
A modeling method of approximated transition system based on the approximate solution of matrix is developed, which provides a facility for approximately formal semantic modeling for linear systems and to effectively analyze errors.

### A comparison of preconditioners for complex-valued matrices

• Computer Science
• 2007
This paper compares the memory efficiency and performance of the ARMS, ILUT, ILUC, and ILUK preconditioners on a specific application area stemming from the diffraction of an acoustic wave incident on a bounded obstacle (governed by the Helmholtz Wave Equation).

## References

SHOWING 1-10 OF 139 REFERENCES

### Domain-Based Parallelism and Problem Decomposition Methods in Computational Science and Engineering

• Computer Science
• 1995
This refereed volume arose from the editors' recognition that physical scientists, engineers, and applied mathematicians are developing, in parallel, solutions to problems of parallelization and focuses on transferable algorithmic techniques, rather than the scientific results themselves.

### Overlapping domain decomposition preconditioners for the generalized Davidson method for the eigenvalue problem

• Computer Science
• 1994
The GD method attempts to improve convergence and robustness at the expense of a more complicated step in the Lanczos method, and can be considered a preconditioned version of Lanczos.

### Practical Use of Some Krylov Subspace Methods for Solving Indefinite and Nonsymmetric Linear Systems

It is shown how an algorithm similar to the SYMMLQ can be derived for nonsymmetric problems and a more economical algorithm based upon the $LU$ factorization with partial pivoting is described.

### Iterative Methods for Solving Bordered Systems with Applications to Continuation Methods

• Mathematics
• 1985
Consider the linear system $M = \left[ {\begin{array}{*{20}c} A & b \\ {c^T } & d \\ \end{array} } \right],$ where A may be nearly singular but the vectors b and c are such that M is nonsingular.

### An Efficient Method for Solving the Three-Dimensional Wide Angle Wave Equation

• Mathematics
• 1986
Abstract : The authors propose a new method for the solution of the wide angle wave equation in three dimensions. In contrast with standard techniques, our approach requires only solutions of

### Krylov subspace methods - Theory, algorithms, and applications

Krylov subspace methods have been very successful in solving linear systems and eigenvalue problems and are now becoming popular for solving nonlinear equations.

### Supercomputer Implementations of Preconditioned Krylov Subspace Methods

It will be argued that some approaches based on multi-coloring can offer good compromises between generality and efficiency, and a number of alternatives are proposed.

### Parallel Solution of General Sparse Linear Systems Using Psparslib Distributed Sparse Linear Systems Eleventh International Conference on Domain Decomposition Methods

• Computer Science
• 1997
Some of the methods implemented in the PSPARSLIB SM95 package are described and a number of strategies used to improve their performance are examined.