Searching for authors named Thierry Braconnier – sorted by Relevance.
14 documents found, showing 1 through 10.
Next 10 →
-
Fvpspack: a Fortran and PVM Package to Compute the Field of Values and Pseudospectra of Large Matrices
- …The field of values and pseudospectra are tools which yield insight into the spectral behavior of a matrix. For large sparse matrices, both sets can be efficiently computed using a Lanczos type method. Since both computations can be done in a natural parallel way, we have developed a package includi…
- Cited by 5 (0 self) – Add To MetaCart
-
Complete Iterative Method for Computing Pseudospectra
- …Efficient codes for computing pseudospectra of large sparse matrices usually use a Lanczos type method with the shift and invert technique and a shift equal to zero. Then, these codes are very efficient for computing pseudospectra on regions where the matrix is nonnormal (because k(A \Gamma zI) \G…
- Cited by 2 (0 self) – Add To MetaCart
-
Influence of Orthogonality on the Backward Error and the Stopping Criterion for Krylov Methods
- …Many algorithms for solving linear systems, least squares problems or eigenproblems need to compute an orthonormal basis. The computation is commonly performed using a QR factorization computed using the classical or the modified Gram-Schmidt algorithm, the Householder algorithm, the Givens algorith…
- Cited by 4 (2 self) – Add To MetaCart
-
Stopping Criteria for Eigensolvers
- …In most iterative methods for solving linear systems, the stopping criterion is based on the backward error. In this paper, after having recalled the situation for linear systems and showed that backward analysis can be used on eigenproblems, we present similar stopping criteria for eigensolvers. We…
- Cited by 14 (5 self) – Add To MetaCart
-
About the qualitative computation of Jordan forms
- …alled Qualitative Computing. It consists of two main objectives : 1. for computations where the influence of finite precision arithmetic remains moderate, to control the global error on the computed result, 2. for computations dominated by round-off (such as chaotic computations), to use the errors…
- Cited by 1 (1 self) – Add To MetaCart
-
Comparative Behaviour of Eigensolvers on Highly Nonnormal Matrices
- …The bad numerical behaviour of iterative solvers for linear systems when applied to highly nonnormal matrices is known and has already been studied. In this paper, we study the influence of the departure from normality on three iterative eigensolvers : the QR algorithm, the Tchebycheff subspace iter…
- Cited by 6 (1 self) – Add To MetaCart
-
A Parallelizable Preconditioner for The Iterative Solution of Implicit Runge-Kutta Type Methods
- …. The main difficulty in the implementation of most standard implicit Runge-Kutta (IRK) methods applied to (stiff) ordinary differential equations (ODE's) is to efficiently solve the nonlinear system of equations. In this article we propose the use of a preconditioner whose decomposition cost for a …
- Cited by 4 (4 self) – Add To MetaCart
-
Using the Field of Values for Pseudospectra Generation
- …The generation of spectral portraits requires the specification of a region in the complex plane which must be pre-determined. For cases where little is known a priori about the spectral properties of a matrix, an accurate and efficient means to compute the outer boundaries of the pseudospectra is d…
- Cited by 5 (2 self) – Add To MetaCart
-
ARNCHEB Users' Guide: Solution of Large Non Symmetric or Non Hermitian Eigenvalue Problems by The Arnoldi-Tchebycheff Method.
- …this document. 2.1.3 Computation of the eigenvalues of H…
- Cited by 4 (1 self) – Add To MetaCart
-
Computations in the Neighbourhood of Algebraic Singularities
- …It is known that finite precision versus exact computation is a crucial issue only when the computation takes place in the neighbourhood of a singularity. In such a situation, it is essential to know the distance to singularity. Much attention has been dedicated to the relationship between the dista…
- Cited by 3 (1 self) – Add To MetaCart
Showing 1 through 10.
Next 10 →
