Computation complexity of a broad variety of practical design problems is known to be strongly depending on an algebraic complexity of corresponding mathematical system representations. Especially some vector-matrix models are frequently used in numerous interdisciplinary fields. One way to overcome the complexity problems is based on some special algebraic structures of low order model approximations, such as e.g. balanced representations. Another approach based on the concept of sparse matrices has also become very popular. As a very successful special case of sparse matrix based approach a class of tridiagonal system representations [1] has found applications in solution of partial differential equations, digital signal proc...
textabstractSolution of large sparse systems of linear equations continues to be a major research ar...
Thesis (Ph.D.)--University of Washington, 2016-08This work demonstrates methods for hyper reduction ...
This paper presents a class of preconditioners for sparse systems arising from discretized partial d...
Computation complexity of a broad variety of practical design problems is known to be strongly dep...
Given a sparse set of differential and algebraic equations (DAEs), it is always recommended to explo...
AbstractAn algorithm is presented for the general solution of a set of linear equations Ax=b. The me...
Multiple-input, multiple-output models for coupled systems in structural dynamics including unbounde...
We present graphics processing unit (GPU) data structures and algorithms to efficiently solve sparse...
We present graphics processing unit (GPU) data structures and algorithms to efficiently solve sparse...
We investigate model reduction of large-scale linear time-invariant systems in generalized state-sp...
Standard algorithms for computing the inverse of a tridiagonal matrix (or more generally, any Hines ...
The reduction of the state-matrix of a linear time-invariant state-space model to a block-diagonal f...
The basic idea of model reduction is to represent a complex linear dynamical system by a much simple...
The basic idea of model reduction is to represent a complex linear dynamical system by a much simple...
Passivity and dissipativity are energy based properties of dynamical systems that may be used for th...
textabstractSolution of large sparse systems of linear equations continues to be a major research ar...
Thesis (Ph.D.)--University of Washington, 2016-08This work demonstrates methods for hyper reduction ...
This paper presents a class of preconditioners for sparse systems arising from discretized partial d...
Computation complexity of a broad variety of practical design problems is known to be strongly dep...
Given a sparse set of differential and algebraic equations (DAEs), it is always recommended to explo...
AbstractAn algorithm is presented for the general solution of a set of linear equations Ax=b. The me...
Multiple-input, multiple-output models for coupled systems in structural dynamics including unbounde...
We present graphics processing unit (GPU) data structures and algorithms to efficiently solve sparse...
We present graphics processing unit (GPU) data structures and algorithms to efficiently solve sparse...
We investigate model reduction of large-scale linear time-invariant systems in generalized state-sp...
Standard algorithms for computing the inverse of a tridiagonal matrix (or more generally, any Hines ...
The reduction of the state-matrix of a linear time-invariant state-space model to a block-diagonal f...
The basic idea of model reduction is to represent a complex linear dynamical system by a much simple...
The basic idea of model reduction is to represent a complex linear dynamical system by a much simple...
Passivity and dissipativity are energy based properties of dynamical systems that may be used for th...
textabstractSolution of large sparse systems of linear equations continues to be a major research ar...
Thesis (Ph.D.)--University of Washington, 2016-08This work demonstrates methods for hyper reduction ...
This paper presents a class of preconditioners for sparse systems arising from discretized partial d...