This proposal details an interface hierarchy for objects whose major function is the mapping of a finite dimensional vector space of dimension m to another vector space of dimension n. This includes many important objects in a solver library, including matrices, their transposes and inverses, solvers, preconditioners, iterative methods, and nonlinear maps. A unifying framework for finite dimensional operators and solvers is proposed which utilizes the composition operation from the operator algebra to achieve great functionality while reducing the size of the interface and complexity of the class structure. A second composition operation is introduced to handle the composition of approximate solution techniques, and related to several commo...
AbstractOperator preconditioning offers a general recipe for constructing preconditioners for discre...
AbstractThe approximate solutions in standard iteration methods for linear systems Ax=b, with A an n...
The resolvent is a fundamental concept in studying various operator splitting algorithms. In this pa...
Development of flexible linear algebra interfaces is an increasingly critical issue. Efficient and e...
Every finite-rank operator on a linear space X is the composition of an operator from X to a finite ...
Abstract. Most efficient linear solvers use composable algorithmic components, with the most common ...
In these lecture notes an introduction to Krylov subspace solvers and preconditioners is presented. ...
This paper discusses the solution of large-scale linear matrix equations using the Induced Dimension...
AbstractThis paper discusses the solution of large-scale linear matrix equations using the Induced D...
Linear algebra forms the basis for much of modern mathematics-theoretical, applied, and computationa...
Abstract — Large-scale systems of linear equations often use parallel iterative methods to approxima...
AbstractA linear mapping from a finite-dimensional linear space to another has a matrix representati...
A good part of matrix theory is functional analytic in spirit. This statement can be turned around. ...
This paper discusses the solution of large-scale linear matrix equations using the Induced Dimension...
Efficient solution of sequences of linear systems is a task arising in numerous applications in engi...
AbstractOperator preconditioning offers a general recipe for constructing preconditioners for discre...
AbstractThe approximate solutions in standard iteration methods for linear systems Ax=b, with A an n...
The resolvent is a fundamental concept in studying various operator splitting algorithms. In this pa...
Development of flexible linear algebra interfaces is an increasingly critical issue. Efficient and e...
Every finite-rank operator on a linear space X is the composition of an operator from X to a finite ...
Abstract. Most efficient linear solvers use composable algorithmic components, with the most common ...
In these lecture notes an introduction to Krylov subspace solvers and preconditioners is presented. ...
This paper discusses the solution of large-scale linear matrix equations using the Induced Dimension...
AbstractThis paper discusses the solution of large-scale linear matrix equations using the Induced D...
Linear algebra forms the basis for much of modern mathematics-theoretical, applied, and computationa...
Abstract — Large-scale systems of linear equations often use parallel iterative methods to approxima...
AbstractA linear mapping from a finite-dimensional linear space to another has a matrix representati...
A good part of matrix theory is functional analytic in spirit. This statement can be turned around. ...
This paper discusses the solution of large-scale linear matrix equations using the Induced Dimension...
Efficient solution of sequences of linear systems is a task arising in numerous applications in engi...
AbstractOperator preconditioning offers a general recipe for constructing preconditioners for discre...
AbstractThe approximate solutions in standard iteration methods for linear systems Ax=b, with A an n...
The resolvent is a fundamental concept in studying various operator splitting algorithms. In this pa...