AbstractIn this paper, we study the direct solvers for the linear system Ax=b, where A is symmetric and indefinite. We discuss the so-called BBK algorithm and FBP algorithm and propose relaxed forms of them which provide options for fast pivot selection. We also present some numerical tests to show the efficiency of our algorithms
AbstractIn this paper, the convergence property of the inexact Uzawa algorithm for solving symmetric...
[[abstract]]Norm-minimizing-type methods for solving large sparse linear systems with symmetric and ...
This thesis studies the classical finite pivot methods for solving linear programs and their efficie...
AbstractIn this paper, we study the direct solvers for the linear system Ax=b, where A is symmetric ...
This paper illustrates how the communication due to pivoting in the solution of symmetric indefinite...
In this paper, indefinite linear systems with linear constraints are considered. We present a specia...
We discuss a variety of iterative methods that are based on the Arnoldi process for solving large sp...
AbstractIn this paper, indefinite linear systems with linear constraints are considered. We present ...
This paper presents linear algebra techniques used in the implementation of an interior point method...
We present a unified framework for solving linear and convex quadratic programs via interior point m...
This work discusses the design of efficient algorithms for solving symmetric indefinite linear syste...
AbstractNorm-minimizing-type methods for solving large sparse linear systems with symmetric and inde...
Abstract. Maximum weight matchings have become an important tool for solving highly indefinite unsym...
A new approach for the implementation of interior-point methods for solving linear programs is propo...
In barrier methods for constrained optimization, the main work lies in solv-ing large linear systems...
AbstractIn this paper, the convergence property of the inexact Uzawa algorithm for solving symmetric...
[[abstract]]Norm-minimizing-type methods for solving large sparse linear systems with symmetric and ...
This thesis studies the classical finite pivot methods for solving linear programs and their efficie...
AbstractIn this paper, we study the direct solvers for the linear system Ax=b, where A is symmetric ...
This paper illustrates how the communication due to pivoting in the solution of symmetric indefinite...
In this paper, indefinite linear systems with linear constraints are considered. We present a specia...
We discuss a variety of iterative methods that are based on the Arnoldi process for solving large sp...
AbstractIn this paper, indefinite linear systems with linear constraints are considered. We present ...
This paper presents linear algebra techniques used in the implementation of an interior point method...
We present a unified framework for solving linear and convex quadratic programs via interior point m...
This work discusses the design of efficient algorithms for solving symmetric indefinite linear syste...
AbstractNorm-minimizing-type methods for solving large sparse linear systems with symmetric and inde...
Abstract. Maximum weight matchings have become an important tool for solving highly indefinite unsym...
A new approach for the implementation of interior-point methods for solving linear programs is propo...
In barrier methods for constrained optimization, the main work lies in solv-ing large linear systems...
AbstractIn this paper, the convergence property of the inexact Uzawa algorithm for solving symmetric...
[[abstract]]Norm-minimizing-type methods for solving large sparse linear systems with symmetric and ...
This thesis studies the classical finite pivot methods for solving linear programs and their efficie...