MatrixMarket

swMATH4020MaRDI QIDQ16209FDOQ16209

Author name not available (Why is that?)

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

• A multishift, multipole rational QZ method with aggressive early deflation
• A comparison of some methods for bounding connected and disconnected solution sets of interval linear systems
• Middleware for the use of storage in communication.
• Probabilistic bounds for the matrix condition number with extended Lanczos bidiagonalization
• Inexact Arnoldi residual estimates and decay properties for functions of non-Hermitian matrices
• A block principal pivoting algorithm for vertical generalized LCP with a vertical block P-matrix
• The least squares and line search in extracting eigenpairs in Jacobi-Davidson method
• Anymatrix: an extensible MATLAB matrix collection
• Krylov subspace methods for discrete-time algebraic Riccati equations
• Multimedia representation of matrix computations and data
• An implicitly restarted Lanczos bidiagonalization method with refined harmonic shifts for computing smallest singular triplets
• Numerical aspect of large-scale electronic state calculation for flexible device material
• Iterative methods and preconditioning for large and sparse linear systems with applications
• Accelerating block coordinate descent methods with identification strategies
• A contour-integral based method for counting the eigenvalues inside a region
• Flexible GMRES with deflated restarting
• Towards Monte Carlo preconditioning approach and hybrid Monte Carlo algorithms for matrix computations
• Title not available (Why is that?)
• Flexible incomplete Cholesky factorization with multi-parameters to control the number of nonzero elements in preconditioners
• Graph Drawing
• The behavior of symmetric Krylov subspace methods for solving \(Mx=(M-\gamma I)v\).
• Constructing convex solutions via Perron's method
• New algorithms for computing the real structured pseudospectral abscissa and the real stability radius of large and sparse matrices
• An invert-free Arnoldi method for computing interior eigenpairs of large matrices
• Robust linear stability analysis and a new method for computing the action of the matrix exponential
• A rational QZ method
• Parallel stochastic estimation method of eigenvalue distribution
• The block-wise circumcentered-reflection method
• Tailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem
• On global Hessenberg based methods for solving Sylvester matrix equations
• Computation of Smallest Eigenvalues using Spectral Schur Complements
• The iterative solver Risolv with application to the exterior Helmholtz problem
• Efficient estimation of eigenvalue counts in an interval.
• On the method by Rostami for computing the real stability radius of large and sparse matrices
• On matrix nearness problems: distance to delocalization
• Methods for solving underdetermined systems.
• The inexact fixed matrix iteration for solving large linear inequalities in a least squares sense
• Accelerating the induced dimension reduction method using spectral information
• Stopping criteria for inner iterations in inexact potential reduction methods: a computational study
• Dynamic block GMRES: An iterative method for block linear systems
• Harmonic and refined harmonic shift-invert residual Arnoldi and Jacobi-Davidson methods for interior eigenvalue problems
• Increasing the performance of the Jacobi-Davidson method by blocking
• Generalized product-type methods based on bi-conjugate gradient (GPBiCG) for solving shifted linear systems
• A compile/Run-time environment for the automatic transformation of linked list data structures
• Deflation in Krylov subspace methods and distance to uncontrollability
• A FEAST algorithm with oblique projection for generalized eigenvalue problems.
• Eigenvalue embedding of undamped vibroacoustic systems with no-spillover
• Feast eigensolver for non-Hermitian problems
• A toolkit for efficient numerical applications in Java
• Title not available (Why is that?)
• Aesthetic Discrimination of Graph Layouts
• Restarted simpler GMRES augmented with harmonic Ritz vectors and approximate errors
• Blankets joint posterior score for learning Markov network structures
• A class of incomplete orthogonal factorization methods. II: Implemetation and results
• Updating the undamped piezoelectric smart structure system with no-spillover
• A Case for a Biorthogonal Jacobi--Davidson Method: Restarting and Correction Equation
• A subspace method for large-scale eigenvalue optimization
• A convergence analysis of the inexact simplified Jacobi-Davidson algorithm for polynomial eigenvalue problems
• Hierarchical orthogonal factorization: sparse square matrices
• Differential equations for real-structured defectivity measures
• Fields of values of linear pencils and spectral inclusion regions
• Graph Drawing
• A new framework for implicit restarting of the Krylov-Schur algorithm.
• Imposing symmetry in augmented linear systems.
• Predict-and-Recompute Conjugate Gradient Variants
• Parallel minimum norm solution of sparse block diagonal column overlapped underdetermined systems
• TRAX: an approach for the time rational analysis of complex dynamic systems
• Semidefinite inverse eigenvalue problems with prescribed entries and partial eigendata
• Improving GMRES(m) using an adaptive switching controller
• An inverse indefinite numerical range problem
• A Two-Level Preconditioning Framework Based on a Richardson Iterative Process
• An implicit algorithm for computing the minimal Geršgorin set
• Fast Randomized Non-Hermitian Eigensolvers Based on Rational Filtering and Matrix Partitioning
• Title not available (Why is that?)
• The Open Graph Archive: a community-driven effort
• An Object-Oriented Approach to the Design of a User Interface for a Sparse Matrix Package
• Performance-based numerical solver selection in the Lighthouse framework
• A GMRES convergence analysis for localized invariant subspace ill-conditioning
• Iterative refinement of Schur decompositions
• Essentials of programming in Mathematica
• Modeling data locality for the sparse matrix-vector product using distance measures
• Convergence analysis of Anderson‐type acceleration of Richardson's iteration
• Modeling and improving locality for the sparse-matrix–vector product on cache memories
• An algorithm for computing minimal Geršgorin sets.
• Preconditioned gradient iterations for the eigenproblem of definite matrix pairs
• A flexible and adaptive simpler block GMRES with deflated restarting for linear systems with multiple right-hand sides
• A refined Arnoldi type method for large scale eigenvalue problems
• How to Make Simpler GMRES and GCR More Stable
• A new approach for calculating the real stability radius
• A gradient based iterative algorithm for solving structural dynamics model updating problems
• The MIN-cut and vertex separator problem
• On a conjugate directions method for solving strictly convex QP problem
• Tackling box-constrained optimization via a new projected quasi-Newton approach
• The important modes of subsystems: a moment-matching approach
• A Newton-based method for the calculation of the distance to instability
• A refined harmonic Lanczos bidiagonalization method and an implicitly restarted algorithm for computing the smallest singular triplets of large matrices
• Title not available (Why is that?)
• Scientific computations on multi-core systems using different programming frameworks
• Additive and Multiplicative Two-Level Spectral Preconditioning for General Linear Systems
• Semi-definite programming techniques for structured quadratic inverse eigenvalue problems

This page was built for software: MatrixMarket