Add to ORKGx, 71 leaves : ill. ; 29 cmDSJM is a software toolkit written in portable C++ that enables direct determination of sparse Jacobian matrices whose sparsity pattern is a priori known. Using the seed matrix S 2 Rn×p, the Jacobian A 2 Rm×n can be determined by solving AS = B, where B 2 Rm×p has been obtained via finite difference approximation or forward automatic differentiation. Seed matrix S is defined by the nonzero unknowns in A. DSJM includes well-known as well as new column ordering heuristics. Numerical testing is highly promising both in terms of running time and the number of matrix-vector products needed to determine A
The computation of large sparse Jacobian matrices is required in many important large-scale scientif...
In many nonlinear problems it is necessary to estimate the Jacobian matrix of a nonlinear mapping $...
Matrix computation is an important area in high-performance scientific computing. Major computer man...
to my parents. iii DSJM is a software toolkit written in portable C++ that enables direct determinat...
When we solve a system of nonlinear equations or nonlinear least-squares problem by Newton's method ...
Efficient estimation of large sparse Jacobian matrices is a requisite in many large-scale scientifi...
Estimation of large sparse Jacobian matrix is a prerequisite for many scientific and engineering pro...
viii, 83 leaves ; 29 cm.There has been extensive research activities in the last couple of years to ...
In $1974$ A.R. Curtis, M.J.D. Powell, and J.K.Reid published a seminal paper on the estimation of Ja...
Evaluation of the Jacobian is the most computationally expensive operation while solving a non-linea...
AbstractMany scientific applications benefit from the accurate and efficient computation of derivati...
Summary. Using a model from a chromatographic separation process in chemical engineer-ing, we demons...
AbstractIn difference Newton-like methods for solving F(x)=0, the Jacobian matrix F′(x) is approxima...
The computation of large sparse Jacobian matrices is required in many important large-scale scienti ...
The computation of sparse Jacobians is a common subproblem in iterative numerical algorithms. The sp...
The computation of large sparse Jacobian matrices is required in many important large-scale scientif...
In many nonlinear problems it is necessary to estimate the Jacobian matrix of a nonlinear mapping $...
Matrix computation is an important area in high-performance scientific computing. Major computer man...
to my parents. iii DSJM is a software toolkit written in portable C++ that enables direct determinat...
When we solve a system of nonlinear equations or nonlinear least-squares problem by Newton's method ...
Efficient estimation of large sparse Jacobian matrices is a requisite in many large-scale scientifi...
Estimation of large sparse Jacobian matrix is a prerequisite for many scientific and engineering pro...
viii, 83 leaves ; 29 cm.There has been extensive research activities in the last couple of years to ...
In $1974$ A.R. Curtis, M.J.D. Powell, and J.K.Reid published a seminal paper on the estimation of Ja...
Evaluation of the Jacobian is the most computationally expensive operation while solving a non-linea...
AbstractMany scientific applications benefit from the accurate and efficient computation of derivati...
Summary. Using a model from a chromatographic separation process in chemical engineer-ing, we demons...
AbstractIn difference Newton-like methods for solving F(x)=0, the Jacobian matrix F′(x) is approxima...
The computation of large sparse Jacobian matrices is required in many important large-scale scienti ...
The computation of sparse Jacobians is a common subproblem in iterative numerical algorithms. The sp...
The computation of large sparse Jacobian matrices is required in many important large-scale scientif...
In many nonlinear problems it is necessary to estimate the Jacobian matrix of a nonlinear mapping $...
Matrix computation is an important area in high-performance scientific computing. Major computer man...