JDQR

swMATH4021MaRDI QIDQ16210FDOQ16210

Author name not available (Why is that?)

Cited In (only showing first 100 items - show all)

• A Jacobi--Davidson Type Method for the Two-Parameter Eigenvalue Problem
• Nonlinear eigenvalue problems: a challenge for modern eigenvalue methods
• Solution of the \(k\)-th eigenvalue problem in large-scale electronic structure calculations
• A Jacobi--Davidson Type Method for a Right Definite Two-Parameter Eigenvalue Problem
• A Power–Arnoldi algorithm for computing PageRank
• Large-scale computation of pseudospectra using ARPACK and eigs
• Acceleration Techniques for Approximating the Matrix Exponential Operator
• Optimal damping of selected eigenfrequencies using dimension reduction
• Toward the optimal preconditioned eigensolver: Locally optimal block preconditioned conjugate gradient method
• Title not available (Why is that?)
• Using Generalized Cayley Transformations within an Inexact Rational Krylov Sequence Method
• Generalized Tensor Eigenvalue Problems
• A limited memory BFGS algorithm for non-convex minimization with applications in matrix largest eigenvalue problem
• Theory of Inexact Krylov Subspace Methods and Applications to Scientific Computing
• An adaptive homotopy approach for non-selfadjoint eigenvalue problems
• Jacobi--Davidson Style QR and QZ Algorithms for the Reduction of Matrix Pencils
• Title not available (Why is that?)
• Convergence Analysis of Krylov Subspace Iterations with Methods from Potential Theory
• AmgX: A Library for GPU Accelerated Algebraic Multigrid and Preconditioned Iterative Methods
• Jordan structures of alternating matrix polynomials
• Roundoff error analysis of the CholeskyQR2 algorithm
• A numerical method for polynomial eigenvalue problems using contour integral
• A Sylvester–Arnoldi type method for the generalized eigenvalue problem with two‐by‐two operator determinants
• Boundary control approach to the spectral estimation problem: the case of multiple poles
• Birth and death chains on finite trees: computing their stationary distribution and hitting times
• Fast block diagonalization of \(k\)-tridiagonal matrices
• The tan \(\theta \) theorem with relaxed conditions
• Backward error analysis of the shift-and-invert Arnoldi algorithm
• Application of hierarchical matrices for computing the Karhunen-Loève expansion
• A thick-restarted block Arnoldi algorithm with modified Ritz vectors for large eigenproblems
• IRBL: An Implicitly Restarted Block-Lanczos Method for Large-Scale Hermitian Eigenproblems
• SLEPc
• Reduced order solution of structured linear systems arising in certain PDE-constrained optimization problems
• Templates for the Solution of Algebraic Eigenvalue Problems
• Numerical computation of stability and detection of Hopf bifurcations of steady state solutions of delay differential equations
• A two-step approach for model reduction in flexible multibody dynamics
• Bounds for the distance to the nearest correlation matrix
• A large-scale nonlinear eigensolver for the analysis of dispersive nanostructures
• Spectral estimation for diffusions with random sampling times
• An extended basis inexact shift-invert Lanczos for the efficient solution of large-scale generalized eigenproblems
• A robust and efficient parallel SVD solver based on restarted Lanczos bidiagonalization
• Combination of Jacobi–Davidson and conjugate gradients for the partial symmetric eigenproblem
• Matlab code for sorting real Schur forms
• An Inverse Free Preconditioned Krylov Subspace Method for Symmetric Generalized Eigenvalue Problems
• High-Performance Solvers for Dense Hermitian Eigenproblems
• Multilevel preconditioned iterative eigensolvers for Maxwell eigenvalue problems
• Computing eigenelements of real symmetric matrices via optimization
• Shift-invert Arnoldi approximation to the Toeplitz matrix exponential
• Nonlinear eigenvalue problems: Newton-type methods and nonlinear Rayleigh functionals
• Title not available (Why is that?)
• Bounds for eigenvalues of matrix polynomials
• The Riccati algorithm for eigenvalues and invariant subspaces of matrices with inexpensive action
• Title not available (Why is that?)
• Jacobi-Davidson type methods for generalized eigenproblems and polynomial eigenproblems
• Preserving geometric properties of the exponential matrix by block Krylov subspace methods
• Numerical methods for large eigenvalue problems
• Algorithm 845
• An Arnoldi-extrapolation algorithm for computing pagerank
• Absolute and relative Weyl theorems for generalized eigenvalue problems
• An implicitly restarted block Lanczos bidiagonalization method using Leja shifts
• An Arnoldi method for nonlinear eigenvalue problems
• The robust minimal controllability problem
• Numerical methods for general and structured eigenvalue problems.
• JADAMILU: a software code for computing selected eigenvalues of large sparse symmetric matrices
• Harmonic and refined extraction methods for the singular value problem, with applications in least squares problems
• Image Processing with Nonlocal Spectral Bases
• Some theoretical comparisons of refined Ritz vectors and Ritz vectors
• A spectral scheme for Kohn-Sham density functional theory of clusters
• RESCU: a real space electronic structure method
• Barzilai-Borwein-like methods for the extreme eigenvalue problem
• On the computation of structured singular values and pseudospectra
• Non-abelian symmetries in tensor networks: a quantum symmetry space approach
• A filter diagonalization for generalized eigenvalue problems based on the Sakurai-Sugiura projection method
• Dimension reduction for damping optimization in linear vibrating systems
• Krylov subspace techniques for reduced-order modeling of large-scale dynamical systems
• Structured eigenvalue methods for the computation of corner singularities in 3D anisotropic elastic structures
• Adaptive computation of smallest eigenvalues of self-adjoint elliptic partial differential equations.
• Shift-invert Lanczos method for the symmetric positive semidefinite Toeplitz matrix exponential.
• An adaptive-order rational Arnoldi method for model-order reductions of linear time-invariant systems
• On the use of moment-matching to build reduced order models in flexible multibody dynamics
• Criteria for global pinning-controllability of complex networks
• A projection method for nonlinear eigenvalue problems using contour integrals
• Thick-restart Lanczos method for large symmetric eigenvalue problems
• Recent computational developments in Krylov subspace methods for linear systems
• Some progress on parallel modal and vibration analysis using the JAUMIN framework
• Improving implementation of linear discriminant analysis for the high dimension/small sample size problem
• 10.1162/153244304322972667
• Application of the Jacobi-Davidson method for spectral low-rank preconditioning in computational electromagnetics problems
• Performance and Accuracy of LAPACK's Symmetric Tridiagonal Eigensolvers
• Efficient rank reduction of correlation matrices
• Numerical schemes for three-dimensional irregular shape quantum dots over curvilinear coordinate systems
• A Krylov--Schur algorithm for large eigenproblems
• An Implicitly Restarted Refined Bidiagonalization Lanczos Method for Computing a Partial Singular Value Decomposition
• Mathematical modeling of semiconductor quantum dots based on the nonparabolic effective-mass approximation
• Spectral refinement for clustered eigenvalues of quasi-diagonal matrices
• Numerical simulation of three dimensional pyramid quantum dot
• Backward error analysis of the AllReduce algorithm for Householder QR decomposition
• Parallel implementation of the \texttt{MAGPACK} package for the analysis of high-nuclearity spin clusters
• Alternatives to the Rayleigh Quotient for the Quadratic Eigenvalue Problem
• Deciding the Nature of the Coarse Equation through Microscopic Simulations: The Baby-Bathwater Scheme

This page was built for software: JDQR