Add to ORKG<正>A new direct method for solving unsymmetrical sparse linear systems(USLS) arising from meshless methods was introduced. Computation of certain meshless methods such as meshless local Petrov-Galerkin (MLPG) method need to solve large USLS. The proposed solution method for unsymmetrical case perfor...101339-134
We describethe design, implementation, and performance of a frontal code for the solution of large, ...
AbstractIn this work, the solution of a large sparse linear system of equations with an arbitrary sp...
Solution of large sparse linear systems is frequently the most time consuming operation in computati...
A new direct method for solving unsymmetrical sparse linear systems(USLS) arising from meshless meth...
In this paper we propose a direct solution method for the quasi-unsymmetric sparse matrix (QUSM) ari...
In this paper we propose a direct solution method for the quasi-unsymmetric sparse matrix (QUSM) ari...
针对局部Petrov-Galerkin无网格法(MLPG)等无网格方法的计算所产生的大型非对称稀疏线性方程组,介绍了一种新的直接解法.与一般非对称求解过程不同,该解法从现有的对称正定解法中演变出来,其...
The need to solve large sparse linear systems of equations efficiently lies at the heart of many app...
Projection methods are the most widely used methods for computing a few of the extreme eigenvalues o...
We describe the design of a new code for the direct solution of sparse unsymmetric linear systems of...
In this paper, we present the main algorithmic features in the software package SuperLU{_}DIST, a di...
The envelope data structure and the Choleski based (bordering) method for the solution of symmetric ...
In this paper, we present the main algorithmic features in the software package SuperLU DIST, a dis...
AbstractAn algorithm is presented for the general solution of a set of linear equations Ax=b. The me...
We mainly examine the application of the improved version of the quasi-minimal residual (IQMR) metho...
We describethe design, implementation, and performance of a frontal code for the solution of large, ...
AbstractIn this work, the solution of a large sparse linear system of equations with an arbitrary sp...
Solution of large sparse linear systems is frequently the most time consuming operation in computati...
A new direct method for solving unsymmetrical sparse linear systems(USLS) arising from meshless meth...
In this paper we propose a direct solution method for the quasi-unsymmetric sparse matrix (QUSM) ari...
In this paper we propose a direct solution method for the quasi-unsymmetric sparse matrix (QUSM) ari...
针对局部Petrov-Galerkin无网格法(MLPG)等无网格方法的计算所产生的大型非对称稀疏线性方程组,介绍了一种新的直接解法.与一般非对称求解过程不同,该解法从现有的对称正定解法中演变出来,其...
The need to solve large sparse linear systems of equations efficiently lies at the heart of many app...
Projection methods are the most widely used methods for computing a few of the extreme eigenvalues o...
We describe the design of a new code for the direct solution of sparse unsymmetric linear systems of...
In this paper, we present the main algorithmic features in the software package SuperLU{_}DIST, a di...
The envelope data structure and the Choleski based (bordering) method for the solution of symmetric ...
In this paper, we present the main algorithmic features in the software package SuperLU DIST, a dis...
AbstractAn algorithm is presented for the general solution of a set of linear equations Ax=b. The me...
We mainly examine the application of the improved version of the quasi-minimal residual (IQMR) metho...
We describethe design, implementation, and performance of a frontal code for the solution of large, ...
AbstractIn this work, the solution of a large sparse linear system of equations with an arbitrary sp...
Solution of large sparse linear systems is frequently the most time consuming operation in computati...