Arnoldi-Riccati method for large eigenvalue problems (Q1923879): Difference between revisions

The authors propose a new method for computing the largest by absolute value eigenvalue of a large sparse matrix. The method consists of two major steps: a) approximate computation of the corresponding invariant subspace, and b) refinement of the approximation by solving a Riccati equation approximately.

0 references

zbMATH Keywords

Arnoldi-Riccati method

0 references

Krylov subspace

0 references

iterative method

0 references

perturbation

0 references

largest eigenvalue

0 references

large sparse matrix

0 references

invariant subspace

0 references

Riccati equation

0 references

reviewed by

Plamen Yordanov Yalamov

0 references

describes a project that uses

eigs

0 references

IRAM

0 references

Algorithm 432

0 references

Harwell-Boeing sparse matrix collection

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

The principle of minimized iterations in the solution of the matrix eigenvalue problem

0 references

Algorithm 432 [C2]: Solution of the matrix equation AX + XB = C [F4]

0 references

Krylov space methods on state-space control models

0 references

Q3219020

0 references

Three methods for refining estimates of invariant subspaces

0 references

Computing selected eigenvalues of sparse unsymmetric matrices using subspace iteration

0 references

A Hessenberg-Schur method for the problem AX + XB= C

0 references

Tchebychev acceleration technique for large scale nonsymmetric matrices

0 references

Arnoldi-Tchebychev procedure for large scale nonsymmetric matrices

0 references

Preconditioned Krylov Subspace Methods for Lyapunov Matrix Equations

0 references

Q4040931

0 references

Krylov-subspace methods for the Sylvester equation

0 references

Krylov Subspace Methods for Solving Large Lyapunov Equations

0 references

Computational aspects of F. L. Bauer's simultaneous iteration method

0 references

Chebyshev Acceleration Techniques for Solving Nonsymmetric Eigenvalue Problems

0 references

Q5751863

0 references

A block Arnoldi-Chebyshev method for computing the leading eigenpairs of large sparse unsymmetric matrices

0 references

Block-Arnoldi and Davidson methods for unsymmetric large eigenvalue problems

0 references

Implicit Application of Polynomial Filters in a <i>k</i>-Step Arnoldi Method

0 references

Error and Perturbation Bounds for Subspaces Associated with Certain Eigenvalue Problems

0 references

Simultaneous iteration for computing invariant subspaces of non-Hermitian matrices

0 references

Q3998482

0 references

Identifiers

zbMATH Open document ID

0856.65035

0 references

DOI

10.1007/BF01731935

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1923879

@@ Property / describes a project that uses @@
+IRAM
@@ Property / describes a project that uses: IRAM / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Algorithm 432
@@ Property / describes a project that uses: Algorithm 432 / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Harwell-Boeing sparse matrix collection
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+The principle of minimized iterations in the solution of the matrix eigenvalue problem
+Normal rank
@@ Property / cites work @@
+Algorithm 432 [C2]: Solution of the matrix equation AX + XB = C [F4]
+Normal rank
@@ Property / cites work @@
+Krylov space methods on state-space control models
+Normal rank
@@ Property / cites work @@
+Q3219020
@@ Property / cites work: Q3219020 / rank @@
+Normal rank
@@ Property / cites work @@
+Three methods for refining estimates of invariant subspaces
+Normal rank
@@ Property / cites work @@
+Computing selected eigenvalues of sparse unsymmetric matrices using subspace iteration
+Normal rank
@@ Property / cites work @@
+A Hessenberg-Schur method for the problem AX + XB= C
+Normal rank
@@ Property / cites work @@
+Tchebychev acceleration technique for large scale nonsymmetric matrices
+Normal rank
@@ Property / cites work @@
+Arnoldi-Tchebychev procedure for large scale nonsymmetric matrices
+Normal rank
@@ Property / cites work @@
+Preconditioned Krylov Subspace Methods for Lyapunov Matrix Equations
+Normal rank
@@ Property / cites work @@
+Q4040931
@@ Property / cites work: Q4040931 / rank @@
+Normal rank
@@ Property / cites work @@
+Krylov-subspace methods for the Sylvester equation
+Normal rank
@@ Property / cites work @@
+Krylov Subspace Methods for Solving Large Lyapunov Equations
+Normal rank
@@ Property / cites work @@
+Computational aspects of F. L. Bauer's simultaneous iteration method
+Normal rank
@@ Property / cites work @@
+Chebyshev Acceleration Techniques for Solving Nonsymmetric Eigenvalue Problems
+Normal rank
@@ Property / cites work @@
+Q5751863
@@ Property / cites work: Q5751863 / rank @@
+Normal rank
@@ Property / cites work @@
+A block Arnoldi-Chebyshev method for computing the leading eigenpairs of large sparse unsymmetric matrices
+Normal rank
@@ Property / cites work @@
+Block-Arnoldi and Davidson methods for unsymmetric large eigenvalue problems
+Normal rank
@@ Property / cites work @@
+Implicit Application of Polynomial Filters in a <i>k</i>-Step Arnoldi Method
+Normal rank
@@ Property / cites work @@
+Error and Perturbation Bounds for Subspaces Associated with Certain Eigenvalue Problems
+Normal rank
@@ Property / cites work @@
+Simultaneous iteration for computing invariant subspaces of non-Hermitian matrices
+Normal rank
@@ Property / cites work @@
+Q3998482
@@ Property / cites work: Q3998482 / rank @@
+Normal rank