Projection Method for Eigenvalue Problems of Linear Nonsquare Matrix Pencils (Q3382790)

From MaRDI portal

Revision as of 08:59, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Projection Method for Eigenvalue Problems of Linear Nonsquare Matrix Pencils	scientific article

Statements

scholarly article

0 references

Projection Method for Eigenvalue Problems of Linear Nonsquare Matrix Pencils (English)

0 references

Keiichi Morikuni

0 references

SIAM Journal on Matrix Analysis and Applications

0 references

publication date

22 September 2021

0 references

full work available at URL

https://arxiv.org/abs/2007.01183

0 references

zbMATH Keywords

eigenproblem

0 references

linear matrix pencil

0 references

projection

0 references

complex moment

0 references

describes a project that uses

0 references

0 references

0 references

0 references

0 references

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

Meshfree eigenstate calculation of arbitrary quantum well structures

0 references

A numerical method for nonlinear eigenvalue problems using contour integrals

0 references

A numerical method for polynomial eigenvalue problems using contour integral

0 references

Computing Eigenvalues of Real Symmetric Matrices with Rational Filters in Real Arithmetic

0 references

Nonlinear eigenvalue problems and contour integrals

0 references

Generalized inverses. Theory and applications.

0 references

Scalar, Vector, and Matrix Mathematics

0 references

An integral method for solving nonlinear eigenvalue problems

0 references

The Generalized Eigenvalue Problem for Nonsquare Pencils Using a Minimal Perturbation Approach

0 references

Solving Overdetermined Eigenvalue Problems

0 references

The generalized Schur decomposition of an arbitrary pencil A–λB—robust software with error bounds and applications. Part I

0 references

The generalized Schur decomposition of an arbitrary pencil A–λB—robust software with error bounds and applications. Part II

0 references

The computation of Kronecker's canonical form of a singular pencil

0 references

A Filtered Lanczos Procedure for Extreme and Interior Eigenvalue Problems

0 references

Kernel-based Approximation Methods using MATLAB

0 references

LSMR: An Iterative Algorithm for Sparse Least-Squares Problems

0 references

Parallel stochastic estimation method of eigenvalue distribution

0 references

0 references

Low complexity algorithms for electronic structure calculations

0 references

Zolotarev Quadrature Rules and Load Balancing for the FEAST Eigensolver

0 references

The nonlinear eigenvalue problem

0 references

Methods of conjugate gradients for solving linear systems

0 references

0 references

FEAST for Differential Eigenvalue Problems

0 references

Contour integral eigensolver for non-Hermitian systems: a Rayleigh-Ritz-type approach

0 references

A filter diagonalization for generalized eigenvalue problems based on the Sakurai-Sugiura projection method

0 references

A block Arnoldi-type contour integral spectral projection method for solving generalized eigenvalue problems

0 references

Relationships among contour integral-based methods for solving generalized eigenvalue problems

0 references

An Algorithm for the Generalized Eigenvalue Problem for Nonsquare Matrix Pencils by Minimal Perturbation Approach

0 references

Block conjugate gradient algorithms for least squares problems

0 references

The block least squares method for solving nonsymmetric linear systems with multiple right-hand sides

0 references

Feast Eigensolver for Non-Hermitian Problems

0 references

Analysis of singular matrix pencils

0 references

0 references

0 references

Filter analysis for the stochastic estimation of eigenvalue counts

0 references

An Algorithm for Generalized Matrix Eigenvalue Problems

0 references

Inner-Iteration Krylov Subspace Methods for Least Squares Problems

0 references

Convergence of Inner-Iteration GMRES Methods for Rank-Deficient Least Squares Problems

0 references

Efficient estimation of eigenvalue counts in an interval

0 references

LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares

0 references

Numerical Methods for Large Eigenvalue Problems

0 references

A projection method for generalized eigenvalue problems using numerical integration.

0 references

CIRR: a Rayleigh-Ritz method with contour integral for generalized eigenvalue problems

0 references

FEAST As A Subspace Iteration Eigensolver Accelerated By Approximate Spectral Projection

0 references

Kronecker's canonical form and the QZ algorithm

0 references

Projection matrices, generalized inverse matrices, and singular value decomposition.

0 references

Performance evaluation of the Sakurai-Sugiura method with a block Krylov subspace linear solver for large dense Hermitian-definite generalized eigenvalue problems

0 references

A projection method for nonlinear eigenvalue problems using contour integrals

0 references

Identifiers

zbMATH Open document ID

0 references

10.1137/20M1377886

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3382790

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3382790&oldid=36985543"