Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 42 for “"Jacobian matrices"”.
-
Bi-directional determination of sparse Jacobian matrices : algorithms and lower bounds
Efficient estimation of large sparse Jacobian matrices is a requisite in many large-scale scientific and engineering problems. It is known that estimation of non-zeroes of a matrix can be viewed as a graph coloring problem. Due to the presence of dense rows or dense columns, unidirectional …
-
DSJM : a software toolkit for direct determination of sparse Jacobian matrices
… 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 …
-
Efficient computation of Jacobian matrices for entropy stable summation by parts schemes
… efficient formulas for the computation of Jacobian matrices arising from entropy stable summation-by-parts schemes. Competing methods for computing Jacobian matrices include finite difference, automatic differentiation, graph coloring, and Jacobian-free Newton-Krylov methods. In contrast to …
-
Improved implementation of some coloring algorithms for the determination of large and sparse Jacobian matrices
… per iteration are the evaluation of the Jacobian and solving the associated linear system. Many real-life problems are sparse and if we know the sparsity structure of the Jacobian in advance, great computational saving can be achieved. We revisit heuristic algorithms and sparse data …
-
An augmented Jacobian matrix algorithm for tracking homotopy zero curves
… the zero set of this homotopy map. The augmented Jacobian matrix algorithm is part of the software package HOMPACK, and is based on an algorithm developed by W.C. Rheinboldt. The algorithm exists in two forms-one for dense Jacobian matrices, and the other for sparse Jacobian matrices.
-
Graph coloring in sparse derivative matrix computation
… of years to efficiently determine large sparse Jacobian matrices. It is now well known that the estimation of Jacobian matrices can be posed as a graph coloring problem. Unidirectional coloring by Coleman and More [9] and bidirectional coloring independently proposed by Hossain and Steihaug [23] …
-
Spectral-in-time methods for time-evolution partial differential equations
… PDEs. Instead of computing and storing the exact Jacobian matrices, we develop a final-time Jacobian matrix approach that generates much sparser Jacobian matrices. Through comprehensive numerical experiments, we show that this novel approach produces results indistinguishable in accuracy from the …
-
Preconditioned sequential and parallel conjugate gradient algorithms for homotopy curve tracking
… and has separate routines for dense and sparse Jacobian matrices. The HOMPACK algorithms for sparse Jacobian matrices use a preconditioned conjugate gradient algorithm for the computation of the kernel of the homotopy Jacobian matrix, a required linear algebra step for homotopy curve tracking. …
-
Efficient Jacobian Determination by Structure-Revealing Automatic Differentiation
… is concerned with the efficient computation of Jacobian matrices of nonlinear vector maps using automatic differentiation (AD). Specifically, we propose the use of two directed edge separator methods, the weighted minimum separator and natural order separator methods, to exploit the structure of …
-
Discrete Adjoints: Theoretical Analysis, Efficient Computation, and Applications
… a new algorithm for computing sparse Hessian matrices is presented including a complexity analysis and a report on practical experiments. Hence, the first two contributions of this thesis are dedicated to an efficient computation of discrete adjoints. The analysis of discrete adjoints with …
-
Star bi-coloring of bipartite graphs
Evaluation of the Jacobian is the most computationally expensive operation while solving a non-linear system. Knowledge of the sparsity pattern in advance reduces the computational cost. Bi-directional partitioning to determine non-zeroes in the sparse matrix works better than unidirectional …
-
Classification in Supervised Statistical Learning With the New Weighted Newton-Raphson Method
… nonlinear systems of equations with singular Jacobian matrices and is a modification of the ordinary Newton-Raphson algorithm. The quadratic convergence of the WNRM, and high efficiency for optimizing nonlinear likelihood functions, whenever singularity in the Jacobians occur allow for an easy …
-
An improved implementation of sparsity detection of sparse derivative matrices
… Manual determination of sparsity structure of Jacobian matrix for a large problem is complicated and highly error-prone. The main motivation of this research is to propose an efficient algorithm which can effectively detect and represent sparsity of unknown Jacobian matrices. Automated sparsity …
-
Stability Insights from Modeling Chronic Myelogenous Leukemia
… of T-cells. Through linearizing the system with Jacobian matrices with respect to non-delayed and delayed state variables, we seek parameter restrictions toward negative eigenvalues (or those with negative real part), and hence asymptotic stability.
-
Simulation of hydrogen release from a high-pressure chamber considering real gas effects
… Modifications required to calculate the real gas Jacobian matrices and eigenvectors as well as to obtain the Roe's averaged convective fluxes are described. Real gas effect is also modeled by the same state equation. Numerical and analytical results are compared for ideal and real gas conditions. …
-
Kinematics Analysis of Two Parallel Locomotion Mechanisms
… respectively. Based on the screw theory, the Jacobian matrices are assembled. Using Grassmann Line Geometry, each row of the Jacobian matrices is interpreted as a line in 3D space and the analytical conditions of the linear dependency cases are identified, which corresponds to the forward …
-
Automatic simulation-driven reachability using matrix measures
… local bounds on the matrix measure of the Jacobian matrices. We discuss different techniques to compute the matrix measures under different norms: regular Euclidean norm or Euclidean norm under coordinate transformation, such that the exponential rate of the discrepancy function is locally …
-
Nonlinear Estimation for Vision-Based Air-to-Air Tracking
… update algorithm in smaller vectors and matrices is capable of providing a convenient framework for fusing the many sources of information in the design of integrated navigation systems. In this framework, several aiding sensor measurements with different size and update rates are easily …
-
Isogeometric analysis of turbulence and fluid-structure interaction
… and a methodology for deriving shape derivative jacobian matrices is presented, allowing for a monolithic solution of the FSI system at the discrete level, and rendering the fluid and structural computations more robust. These ideas are implemented in the form of an isogeometric parallel …
-
Ramp function approximations of Michaelis-Menten functions in biochemical dynamical systems
… ramp systems. We study the properties of the Jacobian matrices of these systems and then explore equilibria and stability in systems of n ≥ 2 variables. Finally, we make several suggestions regarding future work on biochemical ramp systems.
Page 1 of 3