Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “matrices”

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,657 records · Page 92
All sourcesNASA NTRSDOE OSTI
DOE OSTI2018

On the Characteristic Polynomial and Eigenvectors in Terms of the Tree-Like Structure of a Digraph

Regarding a square matrix as the adjacency matrix of a weighted digraph, we construct an extended digraph whose Laplacian contains the original matrix as a submatrix. This construction allows us to use known results on Laplacians to study arbitrary square matrices. The calculation of an eigenvector in a parametric form demonstrates a connection between its components and the tree-like structure of the digraph.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Adaptive Wavelet Decomposition of Matrix Flows

Adaptive algorithms for constructing spline-wavelet decompositions of matrix flows from a linear space of matrices over a normed field are presented. The algorithms suggested provides for an a priori prescribed estimate of the deviation of the basic flow from the initial one. Comparative bounds of the volumes of data in the basic flow for various irregularity characteristics of the initial flow are obtained in the cases of pseudo-equidistant and adaptive grids. Limit characteristics of the above-mentioned volumes are given in the cases where the initial flow is generated by differentiable functions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Two-Level Least Squares Methods in Krylov Subspaces

Two-level least squares acceleration approaches are applied to the Chebyshev acceleration method and the restarted conjugate residual method in solving systems of linear algebraic equations with sparse unsymmetric coefficient matrices arising from finite volume or finite element approximations of boundary-value problems on irregular grids. Application of the proposed idea to other iterative restarted processes also is considered. The efficiency of the algorithms suggested is investigated numerically on a set of model Dirichlet problems for the convection-diffusion equation.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

An Approach to Bounding the Spectral Radius of a Weighted Digraph

The paper suggests a general approach to deriving upper bounds for the spectral radii of weighted digraphs. The approach is based on the generalized Wielandt lemma (GWL), which reduces the problem of bounding the spectral radius of a given block matrix to bounding the Perron root of the matrix composed of the norms of the blocks. In the case of the adjacency matrix of weighted graphs and digraphs where all the blocks are square positive (semi)definite matrices of the same order, the GWL takes an especially nice simple form. The second component of the approach consists in applying known upper bounds for the Perron root of a nonnegative matrix. It is shown that the approach suggested covers, in particular, the known upper bounds of the spectral radius and allows one to describe the equality cases.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Asymptotics of the General Solution of a Linear Singularly Perturbed System of Higher-Order Differential Equations with Degenerations

By using the theory of polynomial matrix pencils, we construct the asymptotics of linearly independent solutions of homogeneous singularly perturbed system of linear differential equations of any order m with matrices at higher derivatives degenerating as a small parameter approaches zero. The general case is analyzed. In this case, the limit matrix pencil has several finite and infinite elementary divisors of both the same and different multiplicities. The corresponding asymptotic estimates are presented.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Mechanical Performance of Nodular Cast Irons After Prolonged High-Temperature Exposure

Ductile cast irons (DIs) are widely used in industrial applications. Their use is, however, often limited to components working at room temperature, since prolonged exposure at high temperature can lead to decomposition of both ausferrite and pearlite, with a consequent strength reduction. The present paper evaluated the effects of prolonged high-temperature exposure on microstructure and residual strength of DIs with different matrices, after an isothermal soaking at temperatures between 200 and 600 °C. Microstructural analyses highlighted that long-term exposure at temperatures higher than 500 °C leads to the complete decomposition of ausferritic and pearlitic matrix microstructures, while hardness tests showed that the hardness is stable up to 500 °C for the pearlitic ductile iron (PDI), up to 450-500 °C for the ausferritic ductile iron (ADI) and up to 400-450 °C for the perferritic isothermed ductile iron (IDI). Exposure at 500 °C for 240 h induces a reduction in tensile strength of IDI and ADI, respectively, of 10 and 25% (for both room temperature and 500 °C tensile testing), while it has no significant effects on PDI.

36 MATERIALS SCIENCE↗
DOE OSTI2018

Boundary node Petrov–Galerkin method in solid structures

Based on the interpolation of the Lagrange series and the Finite Block Method (FBM), the formulations of the Boundary Node Petrov–Galerkin Method (BNPGM) are presented in the weak form in this paper and their applications are demonstrated to the elasticity of functionally graded materials, subjected to static and dynamic loads. By introducing the mapping technique, a block of quadratic type is transformed from the Cartesian coordinate to the normalized coordinate with 8 seeds for two-dimensional problems. The first-order partial differential matrices of boundary nodes are obtained in terms of the nodal values of the boundary node, which can be utilized to determine the tractions on the boundary. Time-dependent partial differential equations are analyzed in the Laplace transformed domain and the Durbin’s inversion method is applied to determine the physical values in the time domain. Illustrative numerical examples are given and comparison has been made with the analytical solutions, the Boundary Element Method (BEM) and the Finite Element Method (FEM).

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

An efficient algorithm for solving the generalized trust region subproblem

In this paper, we consider the interval bounded generalized trust region subproblem (GTRS) which is the problem of minimizing a general quadratic function subject to an upper and lower bounded general quadratic constraint. Under the assumption that two matrices from the objective and the constraint functions can be simultaneously diagonalizable via congruence, a diagonalization-based algorithm is introduced to solve it by showing that GTRS is indeed equivalent to a linearly constrained convex univariate problem. Some numerical experiments are given to show the effectiveness of the proposed method and to compare it with the extended Rendl–Wolkowicz algorithm due to Pong and Wolkowicz.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Using a meshless kernel-based method to solve the Black–Scholes variational inequality of American options

Under the Black–Scholes model, the value of an American option solves a free boundary problem which is equivalent to a variational inequality problem. Using positive definite kernels, we discretize the variational inequality problem in spatial direction and derive a sequence of linear complementarity problems (LCPs) in a finite-dimensional euclidean space. We use special kind of kernels to impose homogeneous boundary conditions and to obtain LCPs with positive definite coefficient matrices to guarantee the existence and uniqueness of the solution. The LCPs are then successfully solved iteratively by the projected SOR algorithm.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Generalization of a stability domain estimation method for nonlinear discrete systems

In this paper, we present a generalization approach of an algebraic existing method to estimate stability regions for discrete nonlinear polynomial systems of degree 3. The existing method is based on the enlargement of a guaranteed stability region by applying various steps of a proposed algorithm. Its main limitation is that the initial result has only been subsequently developed in a particular case of a single iteration. The stability domain obtained is consequently not the widest one. Our main contribution in this paper is to develop generalized functions that allow the enlargement of the guaranteed stability region after k iterations, for any value of k. A required fundamental tool is developed and consists in a general formula allowing to give the result of the Kronecker power calculation of two matrices sum. The advantages of this generalization are to reach a larger region of asymptotic stability and to improve the existing methods results. Two application examples illustrate the proposed method.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

A cooperative conjugate gradient method for linear systems permitting efficient multi-thread implementation

This paper revisits, in a multi-thread context, the so-called multi-parameter or block conjugate gradient (B-CG) methods, first proposed as sequential algorithms by O’Leary and Brezinski, for the solution of the linear system Ax=b, for an n-dimensional symmetric positive definite matrix A. Instead of the scalar parameters of the classical CG algorithm, which minimizes a scalar functional at each iteration, multiple descent and conjugate directions are updated simultaneously. Implementation involves the use of multiple threads and the algorithm is referred to as cooperative CG (CCG) to emphasize that each thread now uses information that comes from the other threads. It is shown that for a sufficiently large matrix dimension n, the use of an optimal number of threads results in a worst case flop count of O(n{sup 7/3}) in exact arithmetic. Numerical experiments on a multi-core, multi-thread computer, for synthetic and real matrices, illustrate the theoretical results.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

A new accelerated algorithm for ill-conditioned ridge regression problems

In this work, we study the primal and dual formulations of the regularized least squares problem, in special norm L{sub 2}, named ridge regression. We state the Gradient method for the corresponding primal-dual problem through a fixed point approach. For this formulation, we present an original convergence analysis involving the spectral radius of a suitable iteration matrix. The main contribution of this work is to accelerate the studied method by means of a memory-like strategy. Some connections with the spectral properties of the associated iteration matrices were established to prove the convergence of the accelerated method. Preliminary experiments showed the good performance of the proposed algorithm when applied to solve ill-conditioned problems, providing better results than the conjugate gradient method for this class of problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

An overlapping domain decomposition method for large-scale problems

Discretization of dynamical models defined through partial differential equations leads to large-scale systems. Time-depending condition involves an iterative integration of such kind of systems. In this paper, a novel technique based on overlapped domain decomposition, without preconditioner and scalable, is presented. Due to the domain decomposition, subproblems are solved in parallel without communications, cutting off the computation time and optimizing the computational cost. This direct method describes an optimized parallel strategy to solve the initial problem, providing the exact solution, up to rounding errors. Moreover, it takes into account both physical nature of the problem and deriving numerical properties of the system. It is highly recommended in case of band matrices and a long time interval because of an increasing gain in terms of performance and computational cost with the number of integrations. A deep analysis of the computational cost concludes the paper.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Numerical solution of systems of fractional delay differential equations using a new kind of wavelet basis

In the present paper, a new orthonormal wavelet basis, called Chelyshkov wavelet, is constructed from a class of orthonormal polynomials. These wavelet basis and their properties are utilized to obtain their operational matrix of fractional integration in the Riemann–Liouville sense and delay operational matrix. Convergence and error bound of the expansion by this kind of wavelet functions are investigated. Then, these operational matrices along with the Galerkin approach have been implemented to solve systems of fractional delay differential equations (SFDDEs). The main superiority of the proposed technique is that it reduces SFDDEs to a system of algebraic equations. Moreover, accuracy and efficiency of the suggested Chelyshkov wavelet approach are verified through some linear and nonlinear SFDDEs. Finally, the obtained numerical results are compared with those previously reported in the literature.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Diagonal and circulant or skew-circulant splitting preconditioners for spatial fractional diffusion equations

We propose three new preconditioners: diagonal and optimal-circulant splitting preconditioner, diagonal and skew-circulant splitting preconditioner, and diagonal and optimal-skew-circulant splitting preconditioner for solving the diagonal-plus-Toeplitz linear system discretized from the spatial fractional diffusion equations. Theoretical analysis shows that these three preconditioners can make the eigenvalues of the preconditioned matrices be clustered around 1, especially when the grids of the discretizations are refined. These results coincide with the one about the diagonal and circulant splitting preconditioner constructed recently by Bai et al. (Numer Linear Algebra Appl 24:e2093, 2017). Numerical experiments exhibit that the proposed preconditioners can significantly improve the convergence of the Krylov subspace iteration methods like GMRES and BiCGSTAB, and they outperform the diagonal and circulant splitting preconditioner as well.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Regularization and index reduction for linear differential–algebraic systems

In this paper, a necessary and sufficient condition for the existence of a proportional semistate feedback is established such that the closed loop system is regular and of index at most two. The condition is characterized by a rank condition that involves only the original system coefficient matrices. Also, a new rank condition ensuring that a given linear time-invariant descriptor system is regular and of index at most some specific value is also derived. The developed theory is illustrated through physical and numerical examples.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

H{sub ∞} memory feedback control for uncertain singular Markov jump systems with time-varying delay and input saturation

This paper concerns with the H{sub ∞} robust exponential stability and memory state feedback stabilization of singular Markov jump systems with time-delay and input saturation. Linear matrix inequality conditions are given to guarantee regularity, impulse-freeness and exponential stability for the singular Markov jump system. Moreover, sufficient conditions are presented to ensure the H{sub ∞} disturbance attenuation level, and the design method of memory feedback controller is developed by solving linear matrix inequalities optimization problem without any decompositions of system matrices and equivalent transformation. Furthermore, the function in the proof procedure belongs to multiple Lyapunov-like functions whose advantage lies in their flexibility. Finally, numerical examples are employed to verify the effectiveness of the proposed methods and to illustrate the significant improvement on the conservativeness of some reported results in the literature.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2011

Enzyme-linked immunosorbent assay for detection of organophosphorylated butyrylcholinesterase: A biomarker of exposure to organophosphate agents

A sandwich enzyme-linked immunosorbent assay (sELISA) is developed for detection of organophosphorylated butyrylcholinesterase (OP-BChE), a potential biomarker for human exposure to organophosphate insecticides and nerve agents. A pair of antibodies specific to OP-BChE adduct were identified through systematic screening of several anti BChE antibodies (anti-BChE) and anti-phosphoserine antibodies (anti-Pser) from different sources. The selected anti-BChE (set as capture antibody) antibodies recognize both phosphorylated and nonphosphorylated BChE. These antibodies can therefore be used to capture both BChE and OP-BChE from the sample matrices. The anti- Pser (set as detecting antibody) was used to recognize the OP moiety of OP-BChE adducts. With the combination of the selected antibody pair, several key parameters (such as the concentration of anti-BChE and anti-Pser, and the blocking agent) were optimized to enhance the sensitivity and selectivity of the sELISA. Under the optimal conditions, the sELISA has shown a wide linear range from 0.03 nM to 30 nM, with a detection limit of 0.03 nM. Furthermore, the sELISA was successfully applied to detect OP-BChE using in-vitro biological samples such as rat plasma spiked with OP-BChE with excellent adduct recovery (z>99 %). These results demonstrate that this novel approach holds great promise to develop an ELISA kit and offers a simple and cost-effective tool for screening/evaluating exposure to organophosphate insecticides and nerve agents.

60 APPLIED LIFE SCIENCES↗