MatrixMarket

swMATH4020MaRDI QIDQ16209FDOQ16209

Author name not available (Why is that?)

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

• A comparison of some methods for bounding connected and disconnected solution sets of interval linear systems
• Middleware for the use of storage in communication.
• 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
• Methods for solving underdetermined systems
• 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
• A Subspace Method for Large-Scale Eigenvalue Optimization
• Numerical aspect of large-scale electronic state calculation for flexible device material
• Accelerating block coordinate descent methods with identification strategies
• A contour-integral based method for counting the eigenvalues inside a region
• Towards Monte Carlo preconditioning approach and hybrid Monte Carlo algorithms for matrix computations
• On Matrix Nearness Problems: Distance to Delocalization
• Eigenvalue Embedding of Undamped Vibroacoustic Systems with No-spillover
• Title not available (Why is that?)
• Graph Drawing
• The behavior of symmetric Krylov subspace methods for solving \(Mx=(M-\gamma I)v\).
• Constructing convex solutions via Perron's method
• An invert-free Arnoldi method for computing interior eigenpairs of large matrices
• A FEAST algorithm with oblique projection for generalized eigenvalue problems
• Probabilistic Bounds for the Matrix Condition Number with Extended Lanczos Bidiagonalization
• 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
• Flexible GMRES with Deflated Restarting
• Fields of Values of Linear Pencils and Spectral Inclusion Regions
• Computation of Smallest Eigenvalues using Spectral Schur Complements
• On the method by Rostami for computing the real stability radius of large and sparse matrices
• Hierarchical Orthogonal Factorization: Sparse Square Matrices
• The inexact fixed matrix iteration for solving large linear inequalities in a least squares sense
• Accelerating the induced dimension reduction method using spectral information
• A Multishift, Multipole Rational QZ Method with Aggressive Early Deflation
• 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
• Differential Equations for Real-Structured Defectivity Measures
• Generalized product-type methods based on bi-conjugate gradient (GPBiCG) for solving shifted linear systems
• New Algorithms for Computing the Real Structured Pseudospectral Abscissa and the Real Stability Radius of Large and Sparse Matrices
• A compile/Run-time environment for the automatic transformation of linked list data structures
• Deflation in Krylov subspace methods and distance to uncontrollability
• 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
• Title not available (Why is that?)
• 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
• Efficient estimation of eigenvalue counts in an interval
• A Case for a Biorthogonal Jacobi--Davidson Method: Restarting and Correction Equation
• Flexible incomplete Cholesky factorization with multi‐parameters to control the number of nonzero elements in preconditioners
• The Iterative Solver RISOLV with Application to the Exterior Helmholtz Problem
• A convergence analysis of the inexact simplified Jacobi-Davidson algorithm for polynomial eigenvalue problems
• Robust Linear Stability Analysis and a New Method for Computing the Action of the Matrix Exponential
• Increasing the Performance of the Jacobi--Davidson Method by Blocking
• A Rational QZ Method
• Essentials of Programming in Mathematica®
• Graph Drawing
• Predict-and-Recompute Conjugate Gradient Variants
• An implicit algorithm for computing the minimal Gersgorin set
• Semidefinite inverse eigenvalue problems with prescribed entries and partial eigendata
• A GMRES Convergence Analysis for Localized Invariant Subspace Ill-Conditioning
• Improving GMRES(m) using an adaptive switching controller
• A new framework for implicit restarting of the Krylov-Schur algorithm
• Imposing symmetry in augmented linear systems
• An inverse indefinite numerical range problem
• A Two-Level Preconditioning Framework Based on a Richardson Iterative Process
• Parallel Minimum Norm Solution of Sparse Block Diagonal Column Overlapped Underdetermined Systems
• TRAX: An approach for the time rational analysis of complex dynamic systems
• Fast Randomized Non-Hermitian Eigensolvers Based on Rational Filtering and Matrix Partitioning
• Title not available (Why is that?)
• 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
• Iterative refinement of Schur decompositions
• An algorithm for computing minimal Geršgorin sets
• 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
• The Open Graph Archive: A Community-Driven Effort
• Algebraic Multilevel Krylov Methods
• 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
• A Newton-based method for the calculation of the distance to instability
• Randomized Iterative Methods for Linear Systems
• 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
• The university of Florida sparse matrix collection
• Semi-definite programming techniques for structured quadratic inverse eigenvalue problems

This page was built for software: MatrixMarket