Nonlinear matrix equations arise frequently in applied probability, especially in the numerical solution of many stochastic models in queueing, inventory, communications, and dam theories. Due to the huge amount of computations involved in these nonlinear matrix equations, the existing algorithms for the solutions have not been satisfactory. With the advent of parallel computers, the door is open for efficient parallel algorithms to tackle the problem. This paper is an effort in this direction. A parallel algorithm on distributed computer systems is devised, and numerical experiment is done on the hypercube
In this paper a non-recursive Strassen’s matrix multiplication algorithm is presented. This new algo...
We describe the design and computational performance of parallel row-oriented tensor algorithms for ...
A number of parallel formulations of dense matrix multiplication algorithm have been developed. For ...
[[abstract]]In this paper we use hypercube computers for solving linear systems. First, the pivoting...
We consider solving triangular systems of linear equations on a hypercube multiprocessor. Specifica...
This paper describes a set of concurrent algorithms for matrix algebra, based on a library of collec...
This paper describes a set of concurrent algorithms for matrix algebra, based on a library of collec...
This paper is concerned with parallel algorithms for matrix factorization on distributed-memory, mes...
Abstract. Agroup ofparallel algorithms,and theirimplementation forsolving a special class ofnonlinea...
As computing machines advance, new fields are explored and old ones are expanded. This thesis consid...
We develop an algorithm for solving nonlinear two-stage stochastic problems with network recourse. T...
We develop an algorithm for solving nonlinear two-stage stochastic problems with network recourse. T...
We describe the solution of linear systems of equations, Ax = b, on distributed-memory concurrent co...
We describe the solution of linear systems of equations, Ax = b, on distributed-memory concurrent co...
Newton-Raphson DC analysis of large-scale nonlinear circuits may be an extremely time consuming proc...
In this paper a non-recursive Strassen’s matrix multiplication algorithm is presented. This new algo...
We describe the design and computational performance of parallel row-oriented tensor algorithms for ...
A number of parallel formulations of dense matrix multiplication algorithm have been developed. For ...
[[abstract]]In this paper we use hypercube computers for solving linear systems. First, the pivoting...
We consider solving triangular systems of linear equations on a hypercube multiprocessor. Specifica...
This paper describes a set of concurrent algorithms for matrix algebra, based on a library of collec...
This paper describes a set of concurrent algorithms for matrix algebra, based on a library of collec...
This paper is concerned with parallel algorithms for matrix factorization on distributed-memory, mes...
Abstract. Agroup ofparallel algorithms,and theirimplementation forsolving a special class ofnonlinea...
As computing machines advance, new fields are explored and old ones are expanded. This thesis consid...
We develop an algorithm for solving nonlinear two-stage stochastic problems with network recourse. T...
We develop an algorithm for solving nonlinear two-stage stochastic problems with network recourse. T...
We describe the solution of linear systems of equations, Ax = b, on distributed-memory concurrent co...
We describe the solution of linear systems of equations, Ax = b, on distributed-memory concurrent co...
Newton-Raphson DC analysis of large-scale nonlinear circuits may be an extremely time consuming proc...
In this paper a non-recursive Strassen’s matrix multiplication algorithm is presented. This new algo...
We describe the design and computational performance of parallel row-oriented tensor algorithms for ...
A number of parallel formulations of dense matrix multiplication algorithm have been developed. For ...