IRAM

swMATH8795MaRDI QIDQ20795

No author found.

Related Items (only showing first 100 items - show all)

Pole placement preconditioning ⋮ On the computation of a truncated SVD of a large linear discrete ill-posed problem ⋮ IRAM-based method for eigenpairs and their derivatives of large matrix-valued functions ⋮ Krylov type subspace methods for matrix polynomials ⋮ A harmonic restarted Arnoldi algorithm for calculating eigenvalues and determining multiplicity ⋮ A new restarting method in the Arnoldi algorithm for computing the eigenvalues of a nonsymmetric matrix ⋮ A modified harmonic block Arnoldi algorithm with adaptive shifts for large interior eigen\-problems ⋮ New Algorithms for Computing the Real Structured Pseudospectral Abscissa and the Real Stability Radius of Large and Sparse Matrices ⋮ Spectral collocation for multiparameter eigenvalue problems arising from separable boundary value problems ⋮ A new technique for determining coupled modes of structure-acoustic systems ⋮ An implicitly restarted block Lanczos bidiagonalization method using Leja shifts ⋮ An efficient algorithm for globally minimizing sum of quadratic ratios problem with nonconvex quadratic constraints ⋮ Implicit Application of Polynomial Filters in a k-Step Arnoldi Method ⋮ The approximation and computation of a basis of the trace space \(H^{1/2}\) ⋮ The $QR$ Steps with Perfect Shifts ⋮ A new shift scheme for the harmonic Arnoldi method ⋮ A block incomplete orthogonalization method for large nonsymmetric eigenproblems ⋮ Algorithms for hyperbolic quadratic eigenvalue problems ⋮ Coherent instability in wall-bounded shear ⋮ A preconditioned Krylov technique for global hydrodynamic stability analysis of large-scale compressible flows ⋮ Convergence analysis for GMsFEM approximation of elliptic eigenvalue problems ⋮ Convergence proof of the harmonic Ritz pairs of iterative projection methods with restart strategies for symmetric eigenvalue problems ⋮ 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 ⋮ Tensor-Krylov method for computing eigenvalues of parameter-dependent matrices ⋮ A new framework for implicit restarting of the Krylov-Schur algorithm ⋮ Fixed support positive-definite modification of covariance matrix estimators via linear shrinkage ⋮ A variant of the Power-Arnoldi algorithm for computing PageRank ⋮ A-posteriori residual bounds for Arnoldi's methods for nonsymmetric eigenvalue problems ⋮ Continuation and Bifurcation of Grain Boundaries in the Swift--Hohenberg Equation ⋮ Maximization of Laplace−Beltrami eigenvalues on closed Riemannian surfaces ⋮ Numerical solution of linear eigenvalue problems ⋮ An Inexact Shift-and-Invert Arnoldi Algorithm for Large Non-Hermitian Generalised Toeplitz Eigenproblems ⋮ A Filtered-Davidson Method for Large Symmetric Eigenvalue Problems ⋮ Computing the smallest singular triplets of a large matrix ⋮ On Chebyshev-Davidson method for symmetric generalized eigenvalue problems ⋮ Jacobi-Davidson algorithm and its application to modeling RF-microwave detection circuits ⋮ Computing pseudospectra using block implicitly restarted Arnoldi iteration ⋮ Approximating the weighted pseudospectra of large matrices ⋮ A Fast Hierarchically Preconditioned Eigensolver Based on Multiresolution Matrix Decomposition ⋮ On expansion of search subspaces for large non-Hermitian eigenproblems ⋮ On restarting the Arnoldi method for large nonsymmetric eigenvalue problems ⋮ 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 ⋮ TRPL+K: Thick-Restart Preconditioned Lanczos+K Method for Large Symmetric Eigenvalue Problems ⋮ On a new variant of Arnoldi method for approximation of eigenpairs ⋮ Computational Materials Science and Engineering ⋮ A semiorthogonal generalized Arnoldi method and its variations for quadratic eigenvalue problems ⋮ Refined isogeometric analysis for generalized Hermitian eigenproblems ⋮ Hybrid Iterative Refined Method for Computing a Few Extreme Eigenpairs of a Symmetric Matrix ⋮ Computing eigenpairs of quadratic eigensystems ⋮ Solving the Faddeev-Merkuriev Equations in Total Orbital Momentum Representation via Spline Collocation and Tensor Product Preconditioning ⋮ Error Analysis of the Lanczos Algorithm for the Nonsymmetric Eigenvalue Problem ⋮ An iterative SVD-Krylov based method for model reduction of large-scale dynamical systems ⋮ A Sparse Decomposition of Low Rank Symmetric Positive Semidefinite Matrices ⋮ A general methodology for investigating flow instabilities in complex geometries: application to natural convection in enclosures ⋮ An Arnoldi based algorithm for large algebraic Riccati equations ⋮ Approximate implicit subspace iteration with alternating directions for LTI system model reduction ⋮ Model reduction of large-scale systems by least squares ⋮ A periodic Krylov-Schur algorithm for large matrix products ⋮ A dynamic thick restarted semi-refined ABLE algorithm for computing a few selected eigentriplets of large nonsymmetric matrices ⋮ Lanczos method for large-scale quaternion singular value decomposition ⋮ Nonlinear eigenvalue problems: a challenge for modern eigenvalue methods ⋮ Convergence conditions for a restarted GMRES method augmented with eigenspaces ⋮ Communication lower bounds and optimal algorithms for numerical linear algebra ⋮ Structured Eigenvalue Problems ⋮ Passivity preserving model reduction via interpolation of spectral zeros ⋮ Arnoldi and Jacobi-Davidson methods for generalized eigenvalue problems $Ax=\lambda Bx$ with singular $B$ ⋮ Bifurcation analysis of a two-component Bose-Einstein condensate ⋮ Robust Linear Stability Analysis and a New Method for Computing the Action of the Matrix Exponential ⋮ Two-Grid and Multiple-Grid Arnoldi for Eigenvalues ⋮ An implicitly restarted Lanczos bidiagonalization method with refined harmonic shifts for computing smallest singular triplets ⋮ Convergence of Arnoldi's method for generalized eigenvalue problems ⋮ On relaxed filtered Krylov subspace method for non-symmetric eigenvalue problems ⋮ A cross-product approach for low-rank approximations of large matrices ⋮ Block imbedding and interlacing results for normal matrices ⋮ Detecting instabilities in flows of viscoelastic fluids ⋮ Arnoldi method for large quaternion right eigenvalue problem ⋮ An Inverse Problem for the $k$-Rank Numerical Range ⋮ A note on harmonic Ritz values and their reciprocals ⋮ Roughness-induced transition by quasi-resonance of a varicose global mode ⋮ Fixing Nonconvergence of Algebraic Iterative Reconstruction with an Unmatched Backprojector ⋮ Low-Rank Solution Methods for Stochastic Eigenvalue Problems ⋮ Feast Eigensolver for Non-Hermitian Problems ⋮ A Rational QZ Method ⋮ Weighted and deflated global GMRES algorithms for solving large Sylvester matrix equations ⋮ A Multishift, Multipole Rational QZ Method with Aggressive Early Deflation ⋮ Hybrid Iterative Refined Method for Computing a Few Extreme Eigenpairs of a Symmetric Matrix ⋮ Implicitly restarted global FOM and GMRES for nonsymmetric matrix equations and Sylvester equations ⋮ Filtered Krylov-like sequence method for symmetric eigenvalue problems ⋮ Minimization of linear functionals defined on solutions of large-scale discrete ill-posed problems ⋮ A preprocessed multi-step splitting iteration for computing PageRank ⋮ A posteriori error estimates of Krylov subspace approximations to matrix functions ⋮ The refined harmonic Arnoldi method and an implicitly restarted refined algorithm for computing interior eigenpairs of large matrices ⋮ A positivity preserving inexact Noda iteration for computing the smallest eigenpair of a large irreducible \(M\)-matrix ⋮ Structured eigenvalue methods for the computation of corner singularities in 3D anisotropic elastic structures ⋮ Computing interior eigenvalues of large sparse symmetric matrices

This page was built for software: IRAM