Search NASA⌕ Search

SEARCH · Search NASA

Results for “linear system”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,315 records · Page 73

Statistical Analysis of the First Passage Path Ensemble of Jump Processes

The transition mechanism of jump processes between two different subsets in state space reveals important dynamical information of the processes and therefore has attracted considerable attention in the past years. In this paper, we study the first passage path ensemble of both discrete-time and continuous-time jump processes on a finite state space. The main approach is to divide each first passage path into nonreactive and reactive segments and to study them separately. The analysis can be applied to jump processes which are non-ergodic, as well as continuous-time jump processes where the waiting time distributions are non-exponential. In the particular case that the jump processes are both Markovian and ergodic, our analysis elucidates the relations between the study of the first passage paths and the study of the transition paths in transition path theory. We provide algorithms to numerically compute statistics of the first passage path ensemble. The computational complexity of these algorithms scales with the complexity of solving a linear system, for which efficient methods are available. Several examples demonstrate the wide applicability of the derived results across research areas.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Evaluation of the Index and Singular Points of Linear Differential-Algebraic Equations of Higher Order

We study linear systems of ordinary differential equations of higher order with an identically singular matrix at the higher derivative of the required vector-valued function in the domain of definition. We give definitions of the index and singular points for these systems, formulate the conditions of solvability, and deduce a formula for the general solution. The algorithms for finding the index and singular points are presented.

97 MATHEMATICS AND COMPUTING↗

Asynchronous Richardson iterations: theory and practice

We consider asynchronous versions of the first- and second-order Richardson methods for solving linear systems of equations. These methods depend on parameters whose values are chosen a priori. We explore the parameter values that can be proven to give convergence of the asynchronous methods. This is the first such analysis for asynchronous second-order methods. We find that for the first-order method, the optimal parameter value for the synchronous case also gives an asynchronously convergent method. For the second-order method, the parameter ranges for which we can prove asynchronous convergence do not contain the optimal parameter values for the synchronous iteration. In practice, however, the asynchronous second-order iterations may still converge using the optimal parameter values, or parameter values close to the optimal ones, despite this result. We explore this behavior with a multithreaded parallel implementation of the asynchronous methods.

97 MATHEMATICS AND COMPUTING↗

Solving security constrained optimal power flow problems by a structure exploiting interior point method

In this paper we present a new approach to solve the DC (n - 1) security constrained optimal power flow (SCOPF) problem by a structure exploiting interior point solver. Our approach is based on a reformulation of the linearised SCOPF model, in which most matrices that need to be factorized are constant. Hence, most factorizations and a large number of back-solve operations only need to be performed once. However, assembling the Schur complement matrix remains expensive in this scheme. To reduce the effort, we suggest using a preconditioned iterative method to solve the corresponding linear system. We suggest two main schemes to pick a good and robust preconditioner based on combining different “active” contingency scenarios of the SCOPF model. These new schemes are implemented within the object-oriented parallel solver (OOPS), a structure-exploiting primal-dual interior-point implementation. We give results on several SCOPF test problems. The largest example contains 500 buses. We compare the results from the original interior point method (IPM) implementation in OOPS and our new reformulation.

30 DIRECT ENERGY CONVERSION↗

Randomized Preconditioned Solvers for Strong Constraint 4D-Var Data Assimilation

The Strong Constraint 4D Variational (SC-4DVAR) data assimilation method is widely used in climate and weather applications. SC-4DVAR involves solving a minimization problem to compute the maximum a posteriori estimate, which we tackle using the Gauss-Newton method. The computation of the descent direction is expensive since it involves the solution of a large-scale and potentially ill-conditioned linear system, solved using the preconditioned conjugate gradient (PCG) method. Here, to address this cost, we efficiently construct scalable preconditioners using three different randomization techniques, which all rely on a certain low-rank structure involving the Gauss-Newton Hessian. The proposed techniques come with theoretical guarantees on the condition number, and at the same time, are amenable to parallelization. We also develop an adaptive approach to estimate the sketch size and choose between the reuse or recomputation of the preconditioner. We demonstrate the performance and effectiveness of our methodology on two representative model problems—the Burgers and barotropic vorticity equation—showing a drastic reduction in both the number of PCG iterations and the number of Gauss-Newton Hessian products after including the preconditioner construction cost.

Gauss-Newton↗

Direct Estimation of Parameters in ODE Models Using WENDy: Weak-Form Estimation of Nonlinear Dynamics

Abstract We introduce the Weak-form Estimation of Nonlinear Dynamics (WENDy) method for estimating model parameters for non-linear systems of ODEs. Without relying on any numerical differential equation solvers, WENDy computes accurate estimates and is robust to large (biologically relevant) levels of measurement noise. For low dimensional systems with modest amounts of data, WENDy is competitive with conventional forward solver-based nonlinear least squares methods in terms of speed and accuracy. For both higher dimensional systems and stiff systems, WENDy is typically both faster (often by orders of magnitude) and more accurate than forward solver-based approaches. The core mathematical idea involves an efficient conversion of the strong form representation of a model to its weak form, and then solving a regression problem to perform parameter inference. The core statistical idea rests on the Errors-In-Variables framework, which necessitates the use of the iteratively reweighted least squares algorithm. Further improvements are obtained by using orthonormal test functions, created from a set of $$C^{\infty }$$ C ∞ bump functions of varying support sizes.We demonstrate the high robustness and computational efficiency by applying WENDy to estimate parameters in some common models from population biology, neuroscience, and biochemistry, including logistic growth, Lotka-Volterra, FitzHugh-Nagumo, Hindmarsh-Rose, and a Protein Transduction Benchmark model. Software and code for reproducing the examples is available at https://github.com/MathBioCU/WENDy .

97 MATHEMATICS AND COMPUTING↗

The generalized Uzawa-SHSS method for non-Hermitian saddle-point problems

Recently, Li and Wu (2015) proposed the single-step Hermitian and skew-Hermitian splitting (SHSS) method for solving the non-Hermitian positive definite linear systems. Based on the single-step Hermitian and skew-Hermitian splitting of the (1,1) part of the saddle-point coefficient matrix, a new Uzawa-type method is proposed for solving a class of saddle-point problems with non-Hermitian positive definite (1,1) parts. Convergence (Semi-convergence) properties of this new method for nonsingular (singular) are derived under suitable conditions. Numerical examples are implemented to confirm the theoretical results and verify that this new method is more feasibility and robustness than the new HSS-like (NHSS-like), the Uzawa-HSS and the parameterized Uzawa-skew-Hermitian triangular splitting (PU-STS) methods for solving both the nonsingular and the singular saddle-point problems with non-Hermitian positive definite and Hermitian dominant (1,1) parts.

97 MATHEMATICS AND COMPUTING↗

Design of C{sup 2} algebraic-trigonometric pythagorean hodograph splines with shape parameters

In this paper, we construct C{sup 2} Algebraic-Trigonometric Pythagorean Hodograph (ATPH) splines by solving a non-linear system of equations in complex variables. We compare these splines, which depend on several shape parameters, with their polynomial PH counterpart as well as with the well-known C{sup 2} cubic B-splines. We finally present criteria for choosing the free shape parameters based on the minimization of certain fairness functionals.

97 MATHEMATICS AND COMPUTING↗

Bernstein dual-Petrov–Galerkin method: application to 2D time fractional diffusion equation

In this paper, we develop a Bernstein dual-Petrov–Galerkin method for the numerical simulation of a two-dimensional fractional diffusion equation. A spectral discretization is applied by introducing suitable combinations of dual Bernstein polynomials as the test functions and the Bernstein polynomials as the trial ones. We derive the exact sparse operational matrix of differentiation for the dual Bernstein basis which provides a matrix-based approach for the spatial discretization. It is shown that the method leads to banded linear systems that can be solved efficiently. The stability and convergence of the proposed method is discussed. Finally, some numerical examples are provided to support the theoretical claims and to show the accuracy and efficiency of the method.

97 MATHEMATICS AND COMPUTING↗

On differential singular perturbation problems: a simple variational approach

An alternative approach for the analysis and the numerical approximation of singular perturbation problems, using a variational framework, is presented. It is based on the natural idea of minimizing the residual of the differential equation measured in the L{sup 2} norm. By this strategy, the approximation is based in the solution of a set of linear problems giving the descent step directions of the problem. This is the main advantage of our approach, since we can use stable and convergent methods for linear problems (without assuming the knowledge of good initial guesses used in the approximation of the associated non-linear systems necessary in Newton-type methods). Remember that for this type of problems, we should use implicit methods. We prove that our procedure can never get stuck in local minima, and the error decreases until getting to the original solution independent of the perturbation parameter. Finally, we include some numerical examples.

97 MATHEMATICS AND COMPUTING↗

An evaluation of reordering algorithms to reduce the computational cost of the incomplete Cholesky-conjugate gradient method

This paper is concerned with applying bandwidth and profile reduction reordering algorithms prior to computing an incomplete Cholesky factorization and using this as a preconditioner for the conjugate gradient method. Hundreds of reordering algorithms have been proposed to solve the problems of bandwidth and profile reductions since the mid-1960s. In previous publications, a large range of heuristics for bandwidth and/or profile reductions was reviewed. Based on this experience, 13 heuristics were selected as the most promising methods. These are evaluated in this paper along with a variant of the breadth-first search procedure that is proposed. Numerical results confirm the effectiveness of this modified reordering algorithm for linear systems derived from specific application areas. Moreover, the most promising heuristics for several application areas are identified when reducing the computational cost of the incomplete Cholesky-conjugate gradient method.

97 MATHEMATICS AND COMPUTING↗

A variant nonmonotone smoothing algorithm with improved numerical results for large-scale LWCPs

This paper considers the linear weighted complementarity problem (denoted by LWCP) introduced by Potra (SIAM J Optim 22:1634–1654, 2012). Based on two weighted smoothing functions, we propose a new nonmonotone smoothing algorithm for solving the LWCP and establish its global and local quadratic convergence without the strict complementarity assumption. Compared to existing nonmonotone smoothing algorithms, the proposed algorithm solves the linear system only approximately which can save the computation work when one solves large-scale LWCPs. Moreover, the nonmonotone line search technique adopted in this paper includes the usual monotone line search and some existing nonmonotone line searches as special cases. Numerical results show that our algorithm is considerably efficient for solving large-scale LWCPs.

97 MATHEMATICS AND COMPUTING↗

A new Uzawa method for fourth-order block saddle point problems

In this paper, we first propose a new Uzawa-SOR method for fourth-order block saddle point problems. Then we study its convergence conditions through some lemmas and theorems. Finally, the numerical results are presented to prove the 4-USOR method we proposed has less workload per iteration and higher accuracy for large linear system than the other Uzawa-type methods for solving the fourth-order block saddle point problem, which shows the effectiveness and feasibility of our method.

97 MATHEMATICS AND COMPUTING↗

Calibrating Bond-Based Peridynamic Parameters Using a Novel Least Squares Approach

Here, we present a novel procedure to calibrate bond micromoduli in a discrete bond-based peridynamics setting. Conventionally, an analytical expression has been used based on strain energy equivalence. In the present work, the micromoduli for individual bonds in a neighborhood are calibrated by equating the effective peridynamic stiffness to the reference material stiffness and posed as a set of linear system of equations. The solution to this is found by a least squares approach which aims to reduce the error in the components of the stiffness matrix. Finally, results for an isotropic case in a local neighborhood of particles are shown to demonstrate the feasibility of this approach.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Uniform Subspace Correction Preconditioners for Discontinuous Galerkin Methods with hp-Refinement

In this paper, we develop subspace correction preconditioners for discontinuous Galerkin (DG) discretizations of elliptic problems with hp-refinement. These preconditioners are based on the decomposition of the DG finite element space into a conforming subspace, and a set of small nonconforming edge spaces. The conforming subspace is preconditioned using a matrix-free low-order refined technique, which in this work, we extend to the hp-refinement context using a variational restriction approach. The condition number of the resulting linear system is independent of the granularity of the mesh h, and the degree of the polynomial approximation p. The method is amenable to use with meshes of any degree of irregularity and arbitrary distribution of polynomial degrees. Furthermore, numerical examples are shown on several test cases involving adaptively and randomly refined meshes, using both the symmetric interior penalty method and the second method of Bassi and Rebay (BR2).

97 MATHEMATICS AND COMPUTING↗

Leveraging operator learning to accelerate convergence of the preconditioned conjugate gradient method

We propose a new deflation strategy to accelerate the convergence of the preconditioned conjugate gradient (PCG) method for solving parametric large-scale linear systems of equations. Unlike traditional deflation techniques that rely on eigenvector approximations or recycled Krylov subspaces, we generate the deflation subspaces using operator learning, specifically the Deep Operator Network (DeepONet). To this aim, we introduce two complementary approaches for assembling the deflation operators. The first approach approximates near-null space vectors of the discrete PDE operator using the basis functions learned by the DeepONet. The second approach directly leverages solutions predicted by the DeepONet. To further enhance convergence, we also propose several strategies for prescribing the sparsity pattern of the deflation operator. Here, a comprehensive set of numerical experiments encompassing steady-state, time-dependent, scalar, and vector-valued problems posed on both structured and unstructured geometries is presented and demonstrates the effectiveness of the proposed DeepONet-based deflated PCG method, as well as its generalization across a wide range of model parameters and problem resolutions.

Deflation↗

HHL algorithm with mapping function and enhanced sampling for model predictive control in microgrids

Here, this paper presents a refined quantum Harrow Hassidim Lloyd (HHL) algorithm for microgrid control. The first novelty of the developed method is that a mapping shift function enables the original HHL algorithm to handle general linear equations with non-singular and indefinite matrix. Second, a method of Matrix Extension for Amplifying Sampling Probabilities of Intended Solution (ME-ASPI) is proposed to design the reformulated linear algebraic equations, allowing for improved sampling efficiency of the quantum tomography in the refined HHL algorithm. Then, we applied the method to solve the model predictive control (MPC) problem in nonlinear dynamical microgrids. Specifically, with the ME-ASPI method, the refined HHL algorithm can effectively obtain the intended partial optimal control inputs for MPC. The optimization of quadratic programming problem in each time step of MPC is transformed into a linear system problem, which is addressed by the proposed quantum solver through using only partial information, with the time complexity improved from $\mathscr{O}(\mathscr{N}^{2.37286})$ classically to $\mathscr{O}(\mathscr{N}^{2} log \mathscr{N}$ x $p$ log $p)$ in quantum. Numerical examples have validated the effectiveness of the refined HHL algorithm with the proposed mapping function and the ME-ASPI method. By leveraging quantum properties, the proposed method provides a hybrid quantum–classical framework for microgrid control. This generic method can also potentially tackle many other challenges in analyzing and controlling general complex engineered systems.

24 POWER TRANSMISSION AND DISTRIBUTION↗

A Crank–Nicolson Leapfrog stabilization: Unconditional stability and two applications

We propose and analyze a linear stabilization of the Crank-Nicolson Leapfrog (CNLF) method that removes all time step/CFL conditions for stability and controls the unstable mode. It also increases the SPD part of the linear system to be solved at each time step while increasing solution accuracy. We give a proof of unconditional stability of the method as well as a proof of unconditional, asymptotic stability of both the stable and unstable modes. As a result, we illustrate two applications of the method: uncoupling groundwater-surface water flows and Stokes flow plus a Coriolis term.

97 MATHEMATICS AND COMPUTING↗