IRAM

MaRDI QIDQ20795swMATHFDO

Official website http://epubs.siam.org/doi/abs/10.1137/0613025

Cited in

(only showing first 100 items - show all)

• Preconditioned Lanczos method for generalized Toeplitz eigenvalue problems
• Exploiting structure in large-scale electrical circuit and power system problems
• A new method for accelerating Arnoldi algorithms for large scale eigenproblems
• The two phase drum with the deepest bass note
• Computation of a few small eigenvalues of a large matrix with application to liquid crystal modeling
• Sensitivity analysis of the largest dependent eigenvalue functions of eigensystems
• EIGIFP
• Restrictions on implicit filtering techniques for orthogonal projection methods
• Polynomial characterizations of the approximate eigenvectors by the refined Arnoldi method and an implicitly restarted refined Arnoldi algorithm
• The symplectic eigenvalue problem, the butterfly form, the SR algorithm, and the Lanczos method
• irbleigs
• JNF
• Block-Arnoldi and Davidson methods for unsymmetric large eigenvalue problems
• Shift-invert and Cayley transforms for detection of rightmost eigenvalues of nonsymmetric matrices
• The rational Krylov algorithm for nonsymmetric eigenvalue problems. III: Complex shifts for real matrices
• Needles
• Refined iterative algorithms based on Arnoldi's process for large unsymmetric eigenproblems
• An implicitly restarted symplectic Lanczos method for the Hamiltonian eigenvalue problem
• Parallel computation of polynomials with minimal uniform norm and its application to large eigenproblems
• A refined iterative algorithm based on the block Arnoldi process for large unsymmetric eigenproblems
• The implicit application of a rational filter in the RKS method
• Error bounds in the isometric Arnoldi process
• An alternative to the Ritz pairs with the EN subspace method
• SRRIT
• Solving large-scale constrained least-squares problems.
• Linear stability analysis in fluid-structure interaction with transpiration. II: Numerical analysis and applications.
• The behavior of symmetric Krylov subspace methods for solving \(Mx=(M-\gamma I)v\).
• PMTBR
• Convexity analysis of the largest dependent eigenvalue functions of eigensystems
• Eigenvalue computation in the 20th century
• Preconditioning eigenvalues and some comparison of solvers
• Iterative methods for large continuation problems
• Analysis of acceleration strategies for restarted minimal residual methods
• Numerical investigation of the first bifurcation for the flow in a rotor-stator cavity of radial aspect ratio 10
• eigs
• The Sylvester equation and approximate balanced reduction
• PROPACK
• MatrixMarket
• JDQR
• PRIMME
• BLOPEX
• FEAST
• TRLan
• An implicit filter for rational Krylov using core transformations
• ARPACK
• IFISS
• Some progress on parallel modal and vibration analysis using the JAUMIN framework
• Convergence of integration-based methods for the solution of standard and generalized Hermitian eigenvalue problems
• An Arnoldi-Inout method accelerated with a two-stage matrix splitting iteration for computing PageRank
• psSchur
• AUTO2000
• Algorithm 747
• TOMS-686
• A new shift strategy for the implicitly restarted refined harmonic Lanczos method
• COCA
• Unstable modes in projection-based reduced-order models: how many can there be, and what do they tell you?
• lambda
• New analytical approximations for the Mathieu functions
• The numerical rank of Krylov matrices
• Discrete variable and finite element techniques applied to simple atomic systems
• Thick-restart Lanczos method for electronic structure calculations
• Computing smallest singular triplets with implicitly restarted Lanczos bidiagonalization
• An iterative block Arnoldi algorithm with modified approximate eigenvectors for large unsymmetric eigenvalue problems
• On Hamiltonian and symplectic Lanczos processes
• The Riccati algorithm for eigenvalues and invariant subspaces of matrices with inexpensive action
• The refined harmonic Arnoldi method and an implicitly restarted refined algorithm for computing interior eigenpairs of large matrices
• Structured eigenvalue methods for the computation of corner singularities in 3D anisotropic elastic structures
• Pole placement preconditioning
• A new restarting method in the Arnoldi algorithm for computing the eigenvalues of a nonsymmetric matrix
• A block incomplete orthogonalization method for large nonsymmetric eigenproblems
• Eigtool
• Seigtool
• JDQZ
• Model reduction of state space systems via an implicitly restarted Lanczos method
• Iterative methods for the computation of a few eigenvalues of a large symmetric matrix
• Arnoldi versus nonsymmetric Lanczos algorithms for solving matrix eigenvalue problems
• Arnoldi-Riccati method for large eigenvalue problems
• Jacobi-Davidson type methods for generalized eigenproblems and polynomial eigenproblems
• Jacobi-Davidson algorithm and its application to modeling RF-microwave detection circuits
• Solution of the eigenvalue problems resulting from global non-parallel flow stability analysis
• Eigenmode solution of 2-D and 3-D electromagnetic cavities containing absorbing materials using the Jacobi-Davidson algorithm
• On relaxed filtered Krylov subspace method for non-symmetric eigenvalue problems
• Harwell-Boeing sparse matrix collection
• MIKA
• Computing interior eigenvalues of large sparse symmetric matrices
• P - ARPACK
• Convergence proof of the harmonic Ritz pairs of iterative projection methods with restart strategies for symmetric eigenvalue problems
• A variant of the Power-Arnoldi algorithm for computing PageRank
• Computing the smallest singular triplets of a large matrix
• On Chebyshev-Davidson method for symmetric generalized eigenvalue problems
• On a new variant of Arnoldi method for approximation of eigenpairs
• Refined isogeometric analysis for generalized Hermitian eigenproblems
• Lanczos method for large-scale quaternion singular value decomposition
• A cross-product approach for low-rank approximations of large matrices
• Arnoldi method for large quaternion right eigenvalue problem
• Weighted and deflated global GMRES algorithms for solving large Sylvester matrix equations
• nextnano
• Filtered Krylov-like sequence method for symmetric eigenvalue problems
• A preprocessed multi-step splitting iteration for computing PageRank
• na26

This page was built for software: IRAM