Solving periodic block tridiagonal systems using the Sherman-Morrison-Woodbury formula

NASA Technical Reports Server (NTRS)

Yarrow, Maurice

1989-01-01

Many algorithms for solving the Navier-Stokes equations require the solution of periodic block tridiagonal systems of equations. By applying a splitting to the matrix representing this system of equations, it may first be reduced to a block tridiagonal matrix plus an outer product of two block vectors. The Sherman-Morrison-Woodbury formula is then applied. The algorithm thus reduces a periodic banded system to a non-periodic banded system with additional right-hand sides and is of higher efficiency than standard Thomas algorithm/LU decompositions.

A spectral tau algorithm based on Jacobi operational matrix for numerical solution of time fractional diffusion-wave equations

NASA Astrophysics Data System (ADS)

Bhrawy, A. H.; Doha, E. H.; Baleanu, D.; Ezz-Eldien, S. S.

2015-07-01

In this paper, an efficient and accurate spectral numerical method is presented for solving second-, fourth-order fractional diffusion-wave equations and fractional wave equations with damping. The proposed method is based on Jacobi tau spectral procedure together with the Jacobi operational matrix for fractional integrals, described in the Riemann-Liouville sense. The main characteristic behind this approach is to reduce such problems to those of solving systems of algebraic equations in the unknown expansion coefficients of the sought-for spectral approximations. The validity and effectiveness of the method are demonstrated by solving five numerical examples. Numerical examples are presented in the form of tables and graphs to make comparisons with the results obtained by other methods and with the exact solutions more easier.

A matrix equation solution by an optimization technique

NASA Technical Reports Server (NTRS)

Johnson, M. J.; Mittra, R.

1972-01-01

The computer solution of matrix equations is often difficult to accomplish due to an ill-conditioned matrix or high noise levels. Two methods of solution are compared for matrices of various degrees of ill-conditioning and for various noise levels in the right hand side vector. One method employs the usual Gaussian elimination. The other solves the equation by an optimization technique and employs a function minimization subroutine.

Theory of biaxial graded-index optical fiber. M.S. Thesis

NASA Technical Reports Server (NTRS)

Kawalko, Stephen F.

1990-01-01

A biaxial graded-index fiber with a homogeneous cladding is studied. Two methods, wave equation and matrix differential equation, of formulating the problem and their respective solutions are discussed. For the wave equation formulation of the problem it is shown that for the case of a diagonal permittivity tensor the longitudinal electric and magnetic fields satisfy a pair of coupled second-order differential equations. Also, a generalized dispersion relation is derived in terms of the solutions for the longitudinal electric and magnetic fields. For the case of a step-index fiber, either isotropic or uniaxial, these differential equations can be solved exactly in terms of Bessel functions. For the cases of an istropic graded-index and a uniaxial graded-index fiber, a solution using the Wentzel, Krammers and Brillouin (WKB) approximation technique is shown. Results for some particular permittivity profiles are presented. Also the WKB solutions is compared with the vector solution found by Kurtz and Streifer. For the matrix formulation it is shown that the tangential components of the electric and magnetic fields satisfy a system of four first-order differential equations which can be conveniently written in matrix form. For the special case of meridional modes, the system of equations splits into two systems of two equations. A general iterative technique, asymptotic partitioning of systems of equations, for solving systems of differential equations is presented. As a simple example, Bessel's differential equation is written in matrix form and is solved using this asymptotic technique. Low order solutions for particular examples of a biaxial and uniaxial graded-index fiber are presented. Finally numerical results obtained using the asymptotic technique are presented for particular examples of isotropic and uniaxial step-index fibers and isotropic, uniaxial and biaxial graded-index fibers.

Matrix algorithms for solving (in)homogeneous bound state equations

PubMed Central

Blank, M.; Krassnigg, A.

2011-01-01

In the functional approach to quantum chromodynamics, the properties of hadronic bound states are accessible via covariant integral equations, e.g. the Bethe–Salpeter equation for mesons. In particular, one has to deal with linear, homogeneous integral equations which, in sophisticated model setups, use numerical representations of the solutions of other integral equations as part of their input. Analogously, inhomogeneous equations can be constructed to obtain off-shell information in addition to bound-state masses and other properties obtained from the covariant analogue to a wave function of the bound state. These can be solved very efficiently using well-known matrix algorithms for eigenvalues (in the homogeneous case) and the solution of linear systems (in the inhomogeneous case). We demonstrate this by solving the homogeneous and inhomogeneous Bethe–Salpeter equations and find, e.g. that for the calculation of the mass spectrum it is as efficient or even advantageous to use the inhomogeneous equation as compared to the homogeneous. This is valuable insight, in particular for the study of baryons in a three-quark setup and more involved systems. PMID:21760640

Radioactivity Calculations

ERIC Educational Resources Information Center

Onega, Ronald J.

1969-01-01

Three problems in radioactive buildup and decay are presented and solved. Matrix algebra is used to solve the second problem. The third problem deals with flux depression and is solved by the use of differential equations. (LC)

Numerical approximations for fractional diffusion equations via a Chebyshev spectral-tau method

NASA Astrophysics Data System (ADS)

Doha, Eid H.; Bhrawy, Ali H.; Ezz-Eldien, Samer S.

2013-10-01

In this paper, a class of fractional diffusion equations with variable coefficients is considered. An accurate and efficient spectral tau technique for solving the fractional diffusion equations numerically is proposed. This method is based upon Chebyshev tau approximation together with Chebyshev operational matrix of Caputo fractional differentiation. Such approach has the advantage of reducing the problem to the solution of a system of algebraic equations, which may then be solved by any standard numerical technique. We apply this general method to solve four specific examples. In each of the examples considered, the numerical results show that the proposed method is of high accuracy and is efficient for solving the time-dependent fractional diffusion equations.

A computational method for solving stochastic Itô–Volterra integral equations based on stochastic operational matrix for generalized hat basis functions

DOE Office of Scientific and Technical Information (OSTI.GOV)

Heydari, M.H., E-mail: heydari@stu.yazd.ac.ir; The Laboratory of Quantum Information Processing, Yazd University, Yazd; Hooshmandasl, M.R., E-mail: hooshmandasl@yazd.ac.ir

2014-08-01

In this paper, a new computational method based on the generalized hat basis functions is proposed for solving stochastic Itô–Volterra integral equations. In this way, a new stochastic operational matrix for generalized hat functions on the finite interval [0,T] is obtained. By using these basis functions and their stochastic operational matrix, such problems can be transformed into linear lower triangular systems of algebraic equations which can be directly solved by forward substitution. Also, the rate of convergence of the proposed method is considered and it has been shown that it is O(1/(n{sup 2}) ). Further, in order to show themore » accuracy and reliability of the proposed method, the new approach is compared with the block pulse functions method by some examples. The obtained results reveal that the proposed method is more accurate and efficient in comparison with the block pule functions method.« less

An approximately factored incremental strategy for calculating consistent discrete aerodynamic sensitivity derivatives

NASA Technical Reports Server (NTRS)

Korivi, V. M.; Taylor, A. C., III; Newman, P. A.; Hou, G. J.-W.; Jones, H. E.

1992-01-01

An incremental strategy is presented for iteratively solving very large systems of linear equations, which are associated with aerodynamic sensitivity derivatives for advanced CFD codes. It is shown that the left-hand side matrix operator and the well-known factorization algorithm used to solve the nonlinear flow equations can also be used to efficiently solve the linear sensitivity equations. Two airfoil problems are considered as an example: subsonic low Reynolds number laminar flow and transonic high Reynolds number turbulent flow.

Computational complexities and storage requirements of some Riccati equation solvers

NASA Technical Reports Server (NTRS)

Utku, Senol; Garba, John A.; Ramesh, A. V.

1989-01-01

The linear optimal control problem of an nth-order time-invariant dynamic system with a quadratic performance functional is usually solved by the Hamilton-Jacobi approach. This leads to the solution of the differential matrix Riccati equation with a terminal condition. The bulk of the computation for the optimal control problem is related to the solution of this equation. There are various algorithms in the literature for solving the matrix Riccati equation. However, computational complexities and storage requirements as a function of numbers of state variables, control variables, and sensors are not available for all these algorithms. In this work, the computational complexities and storage requirements for some of these algorithms are given. These expressions show the immensity of the computational requirements of the algorithms in solving the Riccati equation for large-order systems such as the control of highly flexible space structures. The expressions are also needed to compute the speedup and efficiency of any implementation of these algorithms on concurrent machines.

Development of the Nuclear-Electronic Orbital Approach and Applications to Ionic Liquids and Tunneling Processes

DTIC Science & Technology

2010-02-24

electronic Schrodinger equation . In previous grant cycles, we implemented the NEO approach at the Hartree-Fock (NEO-HF),13 configuration interaction...electronic and nuclear molecular orbitals. The resulting electronic and nuclear Hartree-Fock-Roothaan equations are solved iteratively until self...directly into the standard Hartree- Fock-Roothaan equations , which are solved iteratively to self-consistency. The density matrix representation

An efficient method for solving the steady Euler equations

NASA Technical Reports Server (NTRS)

Liou, M. S.

1986-01-01

An efficient numerical procedure for solving a set of nonlinear partial differential equations is given, specifically for the steady Euler equations. Solutions of the equations were obtained by Newton's linearization procedure, commonly used to solve the roots of nonlinear algebraic equations. In application of the same procedure for solving a set of differential equations we give a theorem showing that a quadratic convergence rate can be achieved. While the domain of quadratic convergence depends on the problems studied and is unknown a priori, we show that firstand second-order derivatives of flux vectors determine whether the condition for quadratic convergence is satisfied. The first derivatives enter as an implicit operator for yielding new iterates and the second derivatives indicates smoothness of the flows considered. Consequently flows involving shocks are expected to require larger number of iterations. First-order upwind discretization in conjunction with the Steger-Warming flux-vector splitting is employed on the implicit operator and a diagonal dominant matrix results. However the explicit operator is represented by first- and seond-order upwind differencings, using both Steger-Warming's and van Leer's splittings. We discuss treatment of boundary conditions and solution procedures for solving the resulting block matrix system. With a set of test problems for one- and two-dimensional flows, we show detailed study as to the efficiency, accuracy, and convergence of the present method.

Matrix Solution of Coupled Differential Equations and Looped Car Following Models

ERIC Educational Resources Information Center

McCartney, Mark

2008-01-01

A simple mathematical model for the behaviour of how vehicles follow each other along a looped stretch of road is described. The resulting coupled first order differential equations are solved using appropriate matrix techniques and the physical significance of the model is discussed. A number possible classroom exercises are suggested to help…

Expansion of Tabulated Scattering Matrices in Generalized Spherical Functions

NASA Technical Reports Server (NTRS)

Mishchenko, Michael I.; Geogdzhayev, Igor V.; Yang, Ping

2016-01-01

An efficient way to solve the vector radiative transfer equation for plane-parallel turbid media is to Fourier-decompose it in azimuth. This methodology is typically based on the analytical computation of the Fourier components of the phase matrix and is predicated on the knowledge of the coefficients appearing in the expansion of the normalized scattering matrix in generalized spherical functions. Quite often the expansion coefficients have to be determined from tabulated values of the scattering matrix obtained from measurements or calculated by solving the Maxwell equations. In such cases one needs an efficient and accurate computer procedure converting a tabulated scattering matrix into the corresponding set of expansion coefficients. This short communication summarizes the theoretical basis of this procedure and serves as the user guide to a simple public-domain FORTRAN program.

Recurrent procedure for constructing nonisotropic matrix elements of the collision integral of the nonlinear Boltzmann equation

NASA Astrophysics Data System (ADS)

Ender, I. A.; Bakaleinikov, L. A.; Flegontova, E. Yu.; Gerasimenko, A. B.

2017-08-01

We have proposed an algorithm for the sequential construction of nonisotropic matrix elements of the collision integral, which are required to solve the nonlinear Boltzmann equation using the moments method. The starting elements of the matrix are isotropic and assumed to be known. The algorithm can be used for an arbitrary law of interactions for any ratio of the masses of colliding particles.

Semi-analytical Karhunen-Loeve representation of irregular waves based on the prolate spheroidal wave functions

NASA Astrophysics Data System (ADS)

Lee, Gibbeum; Cho, Yeunwoo

2018-01-01

A new semi-analytical approach is presented to solving the matrix eigenvalue problem or the integral equation in Karhunen-Loeve (K-L) representation of random data such as irregular ocean waves. Instead of direct numerical approach to this matrix eigenvalue problem, which may suffer from the computational inaccuracy for big data, a pair of integral and differential equations are considered, which are related to the so-called prolate spheroidal wave functions (PSWF). First, the PSWF is expressed as a summation of a small number of the analytical Legendre functions. After substituting them into the PSWF differential equation, a much smaller size matrix eigenvalue problem is obtained than the direct numerical K-L matrix eigenvalue problem. By solving this with a minimal numerical effort, the PSWF and the associated eigenvalue of the PSWF differential equation are obtained. Then, the eigenvalue of the PSWF integral equation is analytically expressed by the functional values of the PSWF and the eigenvalues obtained in the PSWF differential equation. Finally, the analytically expressed PSWFs and the eigenvalues in the PWSF integral equation are used to form the kernel matrix in the K-L integral equation for the representation of exemplary wave data such as ordinary irregular waves. It is found that, with the same accuracy, the required memory size of the present method is smaller than that of the direct numerical K-L representation and the computation time of the present method is shorter than that of the semi-analytical method based on the sinusoidal functions.

Krylov subspace methods - Theory, algorithms, and applications

NASA Technical Reports Server (NTRS)

Sad, Youcef

1990-01-01

Projection methods based on Krylov subspaces for solving various types of scientific problems are reviewed. The main idea of this class of methods when applied to a linear system Ax = b, is to generate in some manner an approximate solution to the original problem from the so-called Krylov subspace span. Thus, the original problem of size N is approximated by one of dimension m, typically much smaller than N. Krylov subspace methods have been very successful in solving linear systems and eigenvalue problems and are now becoming popular for solving nonlinear equations. The main ideas in Krylov subspace methods are shown and their use in solving linear systems, eigenvalue problems, parabolic partial differential equations, Liapunov matrix equations, and nonlinear system of equations are discussed.

Dispersion relations of elastic waves in one-dimensional piezoelectric/piezomagnetic phononic crystal with functionally graded interlayers.

PubMed

Guo, Xiao; Wei, Peijun; Lan, Man; Li, Li

2016-08-01

The effects of functionally graded interlayers on dispersion relations of elastic waves in a one-dimensional piezoelectric/piezomagnetic phononic crystal are studied in this paper. First, the state transfer equation of the functionally graded interlayer is derived from the motion equation by the reduction of order (from second order to first order). The transfer matrix of the functionally graded interlayer is obtained by solving the state transfer equation with the spatial-varying coefficient. Based on the transfer matrixes of the piezoelectric slab, the piezomagnetic slab and the functionally graded interlayers, the total transfer matrix of a single cell is obtained. Further, the Bloch theorem is used to obtain the resultant dispersion equations of in-plane and anti-plane Bloch waves. The dispersion equations are solved numerically and the numerical results are shown graphically. Five kinds of profiles of functionally graded interlayers between a piezoelectric slab and a piezomagnetic slab are considered. It is shown that the functionally graded interlayers have evident influences on the dispersion curves and the band gaps. Copyright © 2016 Elsevier B.V. All rights reserved.

Calculation of biochemical net reactions and pathways by using matrix operations.

PubMed Central

Alberty, R A

1996-01-01

Pathways for net biochemical reactions can be calculated by using a computer program that solves systems of linear equations. The coefficients in the linear equations are the stoichiometric numbers in the biochemical equations for the system. The solution of the system of linear equations is a vector of the stoichiometric numbers of the reactions in the pathway for the net reaction; this is referred to as the pathway vector. The pathway vector gives the number of times the various reactions have to occur to produce the desired net reaction. Net reactions may involve unknown numbers of ATP, ADP, and Pi molecules. The numbers of ATP, ADP, and Pi in a desired net reaction can be calculated in a two-step process. In the first step, the pathway is calculated by solving the system of linear equations for an abbreviated stoichiometric number matrix without ATP, ADP, Pi, NADred, and NADox. In the second step, the stoichiometric numbers in the desired net reaction, which includes ATP, ADP, Pi, NADred, and NADox, are obtained by multiplying the full stoichiometric number matrix by the calculated pathway vector. PMID:8804633

Computationally efficient modeling and simulation of large scale systems

NASA Technical Reports Server (NTRS)

Jain, Jitesh (Inventor); Cauley, Stephen F. (Inventor); Li, Hong (Inventor); Koh, Cheng-Kok (Inventor); Balakrishnan, Venkataramanan (Inventor)

2010-01-01

A method of simulating operation of a VLSI interconnect structure having capacitive and inductive coupling between nodes thereof. A matrix X and a matrix Y containing different combinations of passive circuit element values for the interconnect structure are obtained where the element values for each matrix include inductance L and inverse capacitance P. An adjacency matrix A associated with the interconnect structure is obtained. Numerical integration is used to solve first and second equations, each including as a factor the product of the inverse matrix X.sup.1 and at least one other matrix, with first equation including X.sup.1Y, X.sup.1A, and X.sup.1P, and the second equation including X.sup.1A and X.sup.1P.

A numerical scheme based on radial basis function finite difference (RBF-FD) technique for solving the high-dimensional nonlinear Schrödinger equations using an explicit time discretization: Runge-Kutta method

NASA Astrophysics Data System (ADS)

Dehghan, Mehdi; Mohammadi, Vahid

2017-08-01

In this research, we investigate the numerical solution of nonlinear Schrödinger equations in two and three dimensions. The numerical meshless method which will be used here is RBF-FD technique. The main advantage of this method is the approximation of the required derivatives based on finite difference technique at each local-support domain as Ωi. At each Ωi, we require to solve a small linear system of algebraic equations with a conditionally positive definite matrix of order 1 (interpolation matrix). This scheme is efficient and its computational cost is same as the moving least squares (MLS) approximation. A challengeable issue is choosing suitable shape parameter for interpolation matrix in this way. In order to overcome this matter, an algorithm which was established by Sarra (2012), will be applied. This algorithm computes the condition number of the local interpolation matrix using the singular value decomposition (SVD) for obtaining the smallest and largest singular values of that matrix. Moreover, an explicit method based on Runge-Kutta formula of fourth-order accuracy will be applied for approximating the time variable. It also decreases the computational costs at each time step since we will not solve a nonlinear system. On the other hand, to compare RBF-FD method with another meshless technique, the moving kriging least squares (MKLS) approximation is considered for the studied model. Our results demonstrate the ability of the present approach for solving the applicable model which is investigated in the current research work.

Preconditioned conjugate residual methods for the solution of spectral equations

NASA Technical Reports Server (NTRS)

Wong, Y. S.; Zang, T. A.; Hussaini, M. Y.

1986-01-01

Conjugate residual methods for the solution of spectral equations are described. An inexact finite-difference operator is introduced as a preconditioner in the iterative procedures. Application of these techniques is limited to problems for which the symmetric part of the coefficient matrix is positive definite. Although the spectral equation is a very ill-conditioned and full matrix problem, the computational effort of the present iterative methods for solving such a system is comparable to that for the sparse matrix equations obtained from the application of either finite-difference or finite-element methods to the same problems. Numerical experiments are shown for a self-adjoint elliptic partial differential equation with Dirichlet boundary conditions, and comparison with other solution procedures for spectral equations is presented.

The use of an analytic Hamiltonian matrix for solving the hydrogenic atom

NASA Astrophysics Data System (ADS)

Bhatti, Mohammad

2001-10-01

The non-relativistic Hamiltonian corresponding to the Shrodinger equation is converted into analytic Hamiltonian matrix using the kth order B-splines functions. The Galerkin method is applied to the solution of the Shrodinger equation for bound states of hydrogen-like systems. The program Mathematica is used to create analytic matrix elements and exact integration is performed over the knot-sequence of B-splines and the resulting generalized eigenvalue problem is solved on a specified numerical grid. The complete basis set and the energy spectrum is obtained for the coulomb potential for hydrogenic systems with Z less than 100 with B-splines of order eight. Another application is given to test the Thomas-Reiche-Kuhn sum rule for the hydrogenic systems.

An implicit numerical scheme for the simulation of internal viscous flows on unstructured grids

NASA Technical Reports Server (NTRS)

Jorgenson, Philip C. E.; Pletcher, Richard H.

1994-01-01

The Navier-Stokes equations are solved numerically for two-dimensional steady viscous laminar flows. The grids are generated based on the method of Delaunay triangulation. A finite-volume approach is used to discretize the conservation law form of the compressible flow equations written in terms of primitive variables. A preconditioning matrix is added to the equations so that low Mach number flows can be solved economically. The equations are time marched using either an implicit Gauss-Seidel iterative procedure or a solver based on a conjugate gradient like method. A four color scheme is employed to vectorize the block Gauss-Seidel relaxation procedure. This increases the memory requirements minimally and decreases the computer time spent solving the resulting system of equations substantially. A factor of 7.6 speed up in the matrix solver is typical for the viscous equations. Numerical results are obtained for inviscid flow over a bump in a channel at subsonic and transonic conditions for validation with structured solvers. Viscous results are computed for developing flow in a channel, a symmetric sudden expansion, periodic tandem cylinders in a cross-flow, and a four-port valve. Comparisons are made with available results obtained by other investigators.

Delay differential equations via the matrix Lambert W function and bifurcation analysis: application to machine tool chatter.

PubMed

Yi, Sun; Nelson, Patrick W; Ulsoy, A Galip

2007-04-01

In a turning process modeled using delay differential equations (DDEs), we investigate the stability of the regenerative machine tool chatter problem. An approach using the matrix Lambert W function for the analytical solution to systems of delay differential equations is applied to this problem and compared with the result obtained using a bifurcation analysis. The Lambert W function, known to be useful for solving scalar first-order DDEs, has recently been extended to a matrix Lambert W function approach to solve systems of DDEs. The essential advantages of the matrix Lambert W approach are not only the similarity to the concept of the state transition matrix in lin ear ordinary differential equations, enabling its use for general classes of linear delay differential equations, but also the observation that we need only the principal branch among an infinite number of roots to determine the stability of a system of DDEs. The bifurcation method combined with Sturm sequences provides an algorithm for determining the stability of DDEs without restrictive geometric analysis. With this approach, one can obtain the critical values of delay, which determine the stability of a system and hence the preferred operating spindle speed without chatter. We apply both the matrix Lambert W function and the bifurcation analysis approach to the problem of chatter stability in turning, and compare the results obtained to existing methods. The two new approaches show excellent accuracy and certain other advantages, when compared to traditional graphical, computational and approximate methods.

CPDES3: A preconditioned conjugate gradient solver for linear asymmetric matrix equations arising from coupled partial differential equations in three dimensions

NASA Astrophysics Data System (ADS)

Anderson, D. V.; Koniges, A. E.; Shumaker, D. E.

1988-11-01

Many physical problems require the solution of coupled partial differential equations on three-dimensional domains. When the time scales of interest dictate an implicit discretization of the equations a rather complicated global matrix system needs solution. The exact form of the matrix depends on the choice of spatial grids and on the finite element or finite difference approximations employed. CPDES3 allows each spatial operator to have 7, 15, 19, or 27 point stencils and allows for general couplings between all of the component PDE's and it automatically generates the matrix structures needed to perform the algorithm. The resulting sparse matrix equation is solved by either the preconditioned conjugate gradient (CG) method or by the preconditioned biconjugate gradient (BCG) algorithm. An arbitrary number of component equations are permitted only limited by available memory. In the sub-band representation used, we generate an algorithm that is written compactly in terms of indirect induces which is vectorizable on some of the newer scientific computers.

CPDES2: A preconditioned conjugate gradient solver for linear asymmetric matrix equations arising from coupled partial differential equations in two dimensions

NASA Astrophysics Data System (ADS)

Anderson, D. V.; Koniges, A. E.; Shumaker, D. E.

1988-11-01

Many physical problems require the solution of coupled partial differential equations on two-dimensional domains. When the time scales of interest dictate an implicit discretization of the equations a rather complicated global matrix system needs solution. The exact form of the matrix depends on the choice of spatial grids and on the finite element or finite difference approximations employed. CPDES2 allows each spatial operator to have 5 or 9 point stencils and allows for general couplings between all of the component PDE's and it automatically generates the matrix structures needed to perform the algorithm. The resulting sparse matrix equation is solved by either the preconditioned conjugate gradient (CG) method or by the preconditioned biconjugate gradient (BCG) algorithm. An arbitrary number of component equations are permitted only limited by available memory. In the sub-band representation used, we generate an algorithm that is written compactly in terms of indirect indices which is vectorizable on some of the newer scientific computers.

The spectral applications of Beer-Lambert law for some biological and dosimetric materials

NASA Astrophysics Data System (ADS)

Içelli, Orhan; Yalçin, Zeynel; Karakaya, Vatan; Ilgaz, Işıl P.

2014-08-01

The aim of this study is to conduct quantitative and qualitative analysis of biological and dosimetric materials which contain organic and inorganic materials and to make the determination by using the spectral theorem Beer-Lambert law. Beer-Lambert law is a system of linear equations for the spectral theory. It is possible to solve linear equations with a non-zero coefficient matrix determinant forming linear equations. Characteristic matrix of the linear equation with zero determinant is called point spectrum at the spectral theory.

Adomian decomposition

NASA Astrophysics Data System (ADS)

Daftardar-Gejji, Varsha; Jafari, Hossein

2005-01-01

Adomian decomposition method has been employed to obtain solutions of a system of fractional differential equations. Convergence of the method has been discussed with some illustrative examples. In particular, for the initial value problem: where A=[aij] is a real square matrix, the solution turns out to be , where E([alpha]1,...,[alpha]n),1 denotes multivariate Mittag-Leffler function defined for matrix arguments and Ai is the matrix having ith row as [ai1...ain], and all other entries are zero. Fractional oscillation and Bagley-Torvik equations are solved as illustrative examples.

Solution of the Orr-Sommerfeld equation for the Blausius boundary-layer documentation of program ORRBL and a test case

NASA Technical Reports Server (NTRS)

Biringen, S.; Danabasoglu, G.

1988-01-01

A Chebyshev matrix collocation method is outlined for the solution of the Orr-Sommerfeld equation for the Blausius boundary layer. User information is provided for FORTRAN program ORRBL which solves the equation by the QR method.

Computer programs for the solution of systems of linear algebraic equations

NASA Technical Reports Server (NTRS)

Sequi, W. T.

1973-01-01

FORTRAN subprograms for the solution of systems of linear algebraic equations are described, listed, and evaluated in this report. Procedures considered are direct solution, iteration, and matrix inversion. Both incore methods and those which utilize auxiliary data storage devices are considered. Some of the subroutines evaluated require the entire coefficient matrix to be in core, whereas others account for banding or sparceness of the system. General recommendations relative to equation solving are made, and on the basis of tests, specific subprograms are recommended.

Note on coefficient matrices from stochastic Galerkin methods for random diffusion equations

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zhou Tao, E-mail: tzhou@lsec.cc.ac.c; Tang Tao, E-mail: ttang@hkbu.edu.h

2010-11-01

In a recent work by Xiu and Shen [D. Xiu, J. Shen, Efficient stochastic Galerkin methods for random diffusion equations, J. Comput. Phys. 228 (2009) 266-281], the Galerkin methods are used to solve stochastic diffusion equations in random media, where some properties for the coefficient matrix of the resulting system are provided. They also posed an open question on the properties of the coefficient matrix. In this work, we will provide some results related to the open question.

A Chess-Like Game for Teaching Engineering Students to Solve Large System of Simultaneous Linear Equations

NASA Technical Reports Server (NTRS)

Nguyen, Duc T.; Mohammed, Ahmed Ali; Kadiam, Subhash

2010-01-01

Solving large (and sparse) system of simultaneous linear equations has been (and continues to be) a major challenging problem for many real-world engineering/science applications [1-2]. For many practical/large-scale problems, the sparse, Symmetrical and Positive Definite (SPD) system of linear equations can be conveniently represented in matrix notation as [A] {x} = {b} , where the square coefficient matrix [A] and the Right-Hand-Side (RHS) vector {b} are known. The unknown solution vector {x} can be efficiently solved by the following step-by-step procedures [1-2]: Reordering phase, Matrix Factorization phase, Forward solution phase, and Backward solution phase. In this research work, a Game-Based Learning (GBL) approach has been developed to help engineering students to understand crucial details about matrix reordering and factorization phases. A "chess-like" game has been developed and can be played by either a single player, or two players. Through this "chess-like" open-ended game, the players/learners will not only understand the key concepts involved in reordering algorithms (based on existing algorithms), but also have the opportunities to "discover new algorithms" which are better than existing algorithms. Implementing the proposed "chess-like" game for matrix reordering and factorization phases can be enhanced by FLASH [3] computer environments, where computer simulation with animated human voice, sound effects, visual/graphical/colorful displays of matrix tables, score (or monetary) awards for the best game players, etc. can all be exploited. Preliminary demonstrations of the developed GBL approach can be viewed by anyone who has access to the internet web-site [4]!

Rotman Lens Sidewall Design and Optimization with Hybrid Hardware/Software Based Programming

DTIC Science & Technology

2015-01-09

conventional MoM and stored in memory. The components of Zfar are computed as needed through a fast matrix vector multiplication ( MVM ), which...V vector. Iterative methods, e.g. BiCGSTAB, are employed for solving the linear equation. The matrix-vector multiplications ( MVMs ), which dominate...most of the computation in the solving phase, consists of calculating near and far MVMs . The far MVM comprises aggregation, translation, and

Wavelet-like bases for thin-wire integral equations in electromagnetics

NASA Astrophysics Data System (ADS)

Francomano, E.; Tortorici, A.; Toscano, E.; Ala, G.; Viola, F.

2005-03-01

In this paper, wavelets are used in solving, by the method of moments, a modified version of the thin-wire electric field integral equation, in frequency domain. The time domain electromagnetic quantities, are obtained by using the inverse discrete fast Fourier transform. The retarded scalar electric and vector magnetic potentials are employed in order to obtain the integral formulation. The discretized model generated by applying the direct method of moments via point-matching procedure, results in a linear system with a dense matrix which have to be solved for each frequency of the Fourier spectrum of the time domain impressed source. Therefore, orthogonal wavelet-like basis transform is used to sparsify the moment matrix. In particular, dyadic and M-band wavelet transforms have been adopted, so generating different sparse matrix structures. This leads to an efficient solution in solving the resulting sparse matrix equation. Moreover, a wavelet preconditioner is used to accelerate the convergence rate of the iterative solver employed. These numerical features are used in analyzing the transient behavior of a lightning protection system. In particular, the transient performance of the earth termination system of a lightning protection system or of the earth electrode of an electric power substation, during its operation is focused. The numerical results, obtained by running a complex structure, are discussed and the features of the used method are underlined.

A Mathematics Software Database Update.

ERIC Educational Resources Information Center

Cunningham, R. S.; Smith, David A.

1987-01-01

Contains an update of an earlier listing of software for mathematics instruction at the college level. Topics are: advanced mathematics, algebra, calculus, differential equations, discrete mathematics, equation solving, general mathematics, geometry, linear and matrix algebra, logic, statistics and probability, and trigonometry. (PK)

Improved Quasi-Newton method via PSB update for solving systems of nonlinear equations

NASA Astrophysics Data System (ADS)

Mamat, Mustafa; Dauda, M. K.; Waziri, M. Y.; Ahmad, Fadhilah; Mohamad, Fatma Susilawati

2016-10-01

The Newton method has some shortcomings which includes computation of the Jacobian matrix which may be difficult or even impossible to compute and solving the Newton system in every iteration. Also, the common setback with some quasi-Newton methods is that they need to compute and store an n × n matrix at each iteration, this is computationally costly for large scale problems. To overcome such drawbacks, an improved Method for solving systems of nonlinear equations via PSB (Powell-Symmetric-Broyden) update is proposed. In the proposed method, the approximate Jacobian inverse Hk of PSB is updated and its efficiency has improved thereby require low memory storage, hence the main aim of this paper. The preliminary numerical results show that the proposed method is practically efficient when applied on some benchmark problems.

Efficient ICCG on a shared memory multiprocessor

NASA Technical Reports Server (NTRS)

Hammond, Steven W.; Schreiber, Robert

1989-01-01

Different approaches are discussed for exploiting parallelism in the ICCG (Incomplete Cholesky Conjugate Gradient) method for solving large sparse symmetric positive definite systems of equations on a shared memory parallel computer. Techniques for efficiently solving triangular systems and computing sparse matrix-vector products are explored. Three methods for scheduling the tasks in solving triangular systems are implemented on the Sequent Balance 21000. Sample problems that are representative of a large class of problems solved using iterative methods are used. We show that a static analysis to determine data dependences in the triangular solve can greatly improve its parallel efficiency. We also show that ignoring symmetry and storing the whole matrix can reduce solution time substantially.

MATLAB Simulation of Gradient-Based Neural Network for Online Matrix Inversion

NASA Astrophysics Data System (ADS)

Zhang, Yunong; Chen, Ke; Ma, Weimu; Li, Xiao-Dong

This paper investigates the simulation of a gradient-based recurrent neural network for online solution of the matrix-inverse problem. Several important techniques are employed as follows to simulate such a neural system. 1) Kronecker product of matrices is introduced to transform a matrix-differential-equation (MDE) to a vector-differential-equation (VDE); i.e., finally, a standard ordinary-differential-equation (ODE) is obtained. 2) MATLAB routine "ode45" is introduced to solve the transformed initial-value ODE problem. 3) In addition to various implementation errors, different kinds of activation functions are simulated to show the characteristics of such a neural network. Simulation results substantiate the theoretical analysis and efficacy of the gradient-based neural network for online constant matrix inversion.

Almost analytical Karhunen-Loeve representation of irregular waves based on the prolate spheroidal wave functions

NASA Astrophysics Data System (ADS)

Lee, Gibbeum; Cho, Yeunwoo

2017-11-01

We present an almost analytical new approach to solving the matrix eigenvalue problem or the integral equation in Karhunen-Loeve (K-L) representation of random data such as irregular ocean waves. Instead of solving this matrix eigenvalue problem purely numerically, which may suffer from the computational inaccuracy for big data, first, we consider a pair of integral and differential equations, which are related to the so-called prolate spheroidal wave functions (PSWF). For the PSWF differential equation, the pair of the eigenvectors (PSWF) and eigenvalues can be obtained from a relatively small number of analytical Legendre functions. Then, the eigenvalues in the PSWF integral equation are expressed in terms of functional values of the PSWF and the eigenvalues of the PSWF differential equation. Finally, the analytically expressed PSWFs and the eigenvalues in the PWSF integral equation are used to form the kernel matrix in the K-L integral equation for the representation of exemplary wave data; ordinary irregular waves and rogue waves. We found that the present almost analytical method is better than the conventional data-independent Fourier representation and, also, the conventional direct numerical K-L representation in terms of both accuracy and computational cost. This work was supported by the National Research Foundation of Korea (NRF). (NRF-2017R1D1A1B03028299).

Algorithms for solving large sparse systems of simultaneous linear equations on vector processors

NASA Technical Reports Server (NTRS)

David, R. E.

1984-01-01

Very efficient algorithms for solving large sparse systems of simultaneous linear equations have been developed for serial processing computers. These involve a reordering of matrix rows and columns in order to obtain a near triangular pattern of nonzero elements. Then an LU factorization is developed to represent the matrix inverse in terms of a sequence of elementary Gaussian eliminations, or pivots. In this paper it is shown how these algorithms are adapted for efficient implementation on vector processors. Results obtained on the CYBER 200 Model 205 are presented for a series of large test problems which show the comparative advantages of the triangularization and vector processing algorithms.

User's Manual for PCSMS (Parallel Complex Sparse Matrix Solver). Version 1.

NASA Technical Reports Server (NTRS)

Reddy, C. J.

2000-01-01

PCSMS (Parallel Complex Sparse Matrix Solver) is a computer code written to make use of the existing real sparse direct solvers to solve complex, sparse matrix linear equations. PCSMS converts complex matrices into real matrices and use real, sparse direct matrix solvers to factor and solve the real matrices. The solution vector is reconverted to complex numbers. Though, this utility is written for Silicon Graphics (SGI) real sparse matrix solution routines, it is general in nature and can be easily modified to work with any real sparse matrix solver. The User's Manual is written to make the user acquainted with the installation and operation of the code. Driver routines are given to aid the users to integrate PCSMS routines in their own codes.

An efficient computer based wavelets approximation method to solve Fuzzy boundary value differential equations

NASA Astrophysics Data System (ADS)

Alam Khan, Najeeb; Razzaq, Oyoon Abdul

2016-03-01

In the present work a wavelets approximation method is employed to solve fuzzy boundary value differential equations (FBVDEs). Essentially, a truncated Legendre wavelets series together with the Legendre wavelets operational matrix of derivative are utilized to convert FB- VDE into a simple computational problem by reducing it into a system of fuzzy algebraic linear equations. The capability of scheme is investigated on second order FB- VDE considered under generalized H-differentiability. Solutions are represented graphically showing competency and accuracy of this method.

The U.S. Geological Survey Modular Ground-Water Model - PCGN: A Preconditioned Conjugate Gradient Solver with Improved Nonlinear Control

USGS Publications Warehouse

Naff, Richard L.; Banta, Edward R.

2008-01-01

The preconditioned conjugate gradient with improved nonlinear control (PCGN) package provides addi-tional means by which the solution of nonlinear ground-water flow problems can be controlled as compared to existing solver packages for MODFLOW. Picard iteration is used to solve nonlinear ground-water flow equations by iteratively solving a linear approximation of the nonlinear equations. The linear solution is provided by means of the preconditioned conjugate gradient algorithm where preconditioning is provided by the modi-fied incomplete Cholesky algorithm. The incomplete Cholesky scheme incorporates two levels of fill, 0 and 1, in which the pivots can be modified so that the row sums of the preconditioning matrix and the original matrix are approximately equal. A relaxation factor is used to implement the modified pivots, which determines the degree of modification allowed. The effects of fill level and degree of pivot modification are briefly explored by means of a synthetic, heterogeneous finite-difference matrix; results are reported in the final section of this report. The preconditioned conjugate gradient method is coupled with Picard iteration so as to efficiently solve the nonlinear equations associated with many ground-water flow problems. The description of this coupling of the linear solver with Picard iteration is a primary concern of this document.

On Rank and Nullity

ERIC Educational Resources Information Center

Dobbs, David E.

2012-01-01

This note explains how Emil Artin's proof that row rank equals column rank for a matrix with entries in a field leads naturally to the formula for the nullity of a matrix and also to an algorithm for solving any system of linear equations in any number of variables. This material could be used in any course on matrix theory or linear algebra.

Iterative approach as alternative to S-matrix in modal methods

NASA Astrophysics Data System (ADS)

Semenikhin, Igor; Zanuccoli, Mauro

2014-12-01

The continuously increasing complexity of opto-electronic devices and the rising demands of simulation accuracy lead to the need of solving very large systems of linear equations making iterative methods promising and attractive from the computational point of view with respect to direct methods. In particular, iterative approach potentially enables the reduction of required computational time to solve Maxwell's equations by Eigenmode Expansion algorithms. Regardless of the particular eigenmodes finding method used, the expansion coefficients are computed as a rule by scattering matrix (S-matrix) approach or similar techniques requiring order of M3 operations. In this work we consider alternatives to the S-matrix technique which are based on pure iterative or mixed direct-iterative approaches. The possibility to diminish the impact of M3 -order calculations to overall time and in some cases even to reduce the number of arithmetic operations to M2 by applying iterative techniques are discussed. Numerical results are illustrated to discuss validity and potentiality of the proposed approaches.

A comparison of matrix methods for calculating eigenvalues in acoustically lined ducts

NASA Technical Reports Server (NTRS)

Watson, W.; Lansing, D. L.

1976-01-01

Three approximate methods - finite differences, weighted residuals, and finite elements - were used to solve the eigenvalue problem which arises in finding the acoustic modes and propagation constants in an absorptively lined two-dimensional duct without airflow. The matrix equations derived for each of these methods were solved for the eigenvalues corresponding to various values of wall impedance. Two matrix orders, 20 x 20 and 40 x 40, were used. The cases considered included values of wall admittance for which exact eigenvalues were known and for which several nearly equal roots were present. Ten of the lower order eigenvalues obtained from the three approximate methods were compared with solutions calculated from the exact characteristic equation in order to make an assessment of the relative accuracy and reliability of the three methods. The best results were given by the finite element method using a cubic polynomial. Excellent accuracy was consistently obtained, even for nearly equal eigenvalues, by using a 20 x 20 order matrix.

Efficient propagation-inside-layer expansion algorithm for solving the scattering from three-dimensional nested homogeneous dielectric bodies with arbitrary shape.

PubMed

Bellez, Sami; Bourlier, Christophe; Kubické, Gildas

2015-03-01

This paper deals with the evaluation of electromagnetic scattering from a three-dimensional structure consisting of two nested homogeneous dielectric bodies with arbitrary shape. The scattering problem is formulated in terms of a set of Poggio-Miller-Chang-Harrington-Wu integral equations that are afterwards converted into a system of linear equations (impedance matrix equation) by applying the Galerkin method of moments (MoM) with Rao-Wilton-Glisson basis functions. The MoM matrix equation is then solved by deploying the iterative propagation-inside-layer expansion (PILE) method in order to obtain the unknown surface current densities, which are thereafter used to handle the radar cross-section (RCS) patterns. Some numerical results for various structures including canonical geometries are presented and compared with those of the FEKO software in order to validate the PILE-based approach as well as to show its efficiency to analyze the full-polarized RCS patterns.

Development of a steady potential solver for use with linearized, unsteady aerodynamic analyses

NASA Technical Reports Server (NTRS)

Hoyniak, Daniel; Verdon, Joseph M.

1991-01-01

A full potential steady flow solver (SFLOW) developed explicitly for use with an inviscid unsteady aerodynamic analysis (LINFLO) is described. The steady solver uses the nonconservative form of the nonlinear potential flow equations together with an implicit, least squares, finite difference approximation to solve for the steady flow field. The difference equations were developed on a composite mesh which consists of a C grid embedded in a rectilinear (H grid) cascade mesh. The composite mesh is capable of resolving blade to blade and far field phenomena on the H grid, while accurately resolving local phenomena on the C grid. The resulting system of algebraic equations is arranged in matrix form using a sparse matrix package and solved by Newton's method. Steady and unsteady results are presented for two cascade configurations: a high speed compressor and a turbine with high exit Mach number.

Exact solution of matricial Φ23 quantum field theory

NASA Astrophysics Data System (ADS)

Grosse, Harald; Sako, Akifumi; Wulkenhaar, Raimar

2017-12-01

We apply a recently developed method to exactly solve the Φ3 matrix model with covariance of a two-dimensional theory, also known as regularised Kontsevich model. Its correlation functions collectively describe graphs on a multi-punctured 2-sphere. We show how Ward-Takahashi identities and Schwinger-Dyson equations lead in a special large- N limit to integral equations that we solve exactly for all correlation functions. The solved model arises from noncommutative field theory in a special limit of strong deformation parameter. The limit defines ordinary 2D Schwinger functions which, however, do not satisfy reflection positivity.

Solving modal equations of motion with initial conditions using MSC/NASTRAN DMAP. Part 1: Implementing exact mode superposition

NASA Technical Reports Server (NTRS)

Abdallah, Ayman A.; Barnett, Alan R.; Ibrahim, Omar M.; Manella, Richard T.

1993-01-01

Within the MSC/NASTRAN DMAP (Direct Matrix Abstraction Program) module TRD1, solving physical (coupled) or modal (uncoupled) transient equations of motion is performed using the Newmark-Beta or mode superposition algorithms, respectively. For equations of motion with initial conditions, only the Newmark-Beta integration routine has been available in MSC/NASTRAN solution sequences for solving physical systems and in custom DMAP sequences or alters for solving modal systems. In some cases, one difficulty with using the Newmark-Beta method is that the process of selecting suitable integration time steps for obtaining acceptable results is lengthy. In addition, when very small step sizes are required, a large amount of time can be spent integrating the equations of motion. For certain aerospace applications, a significant time savings can be realized when the equations of motion are solved using an exact integration routine instead of the Newmark-Beta numerical algorithm. In order to solve modal equations of motion with initial conditions and take advantage of efficiencies gained when using uncoupled solution algorithms (like that within TRD1), an exact mode superposition method using MSC/NASTRAN DMAP has been developed and successfully implemented as an enhancement to an existing coupled loads methodology at the NASA Lewis Research Center.

Convergence of the standard RLS method and UDUT factorisation of covariance matrix for solving the algebraic Riccati equation of the DLQR via heuristic approximate dynamic programming

NASA Astrophysics Data System (ADS)

Moraes Rêgo, Patrícia Helena; Viana da Fonseca Neto, João; Ferreira, Ernesto M.

2015-08-01

The main focus of this article is to present a proposal to solve, via UDUT factorisation, the convergence and numerical stability problems that are related to the covariance matrix ill-conditioning of the recursive least squares (RLS) approach for online approximations of the algebraic Riccati equation (ARE) solution associated with the discrete linear quadratic regulator (DLQR) problem formulated in the actor-critic reinforcement learning and approximate dynamic programming context. The parameterisations of the Bellman equation, utility function and dynamic system as well as the algebra of Kronecker product assemble a framework for the solution of the DLQR problem. The condition number and the positivity parameter of the covariance matrix are associated with statistical metrics for evaluating the approximation performance of the ARE solution via RLS-based estimators. The performance of RLS approximators is also evaluated in terms of consistence and polarisation when associated with reinforcement learning methods. The used methodology contemplates realisations of online designs for DLQR controllers that is evaluated in a multivariable dynamic system model.

Minimal parameter solution of the orthogonal matrix differential equation

NASA Technical Reports Server (NTRS)

Bar-Itzhack, Itzhack Y.; Markley, F. Landis

1990-01-01

As demonstrated in this work, all orthogonal matrices solve a first order differential equation. The straightforward solution of this equation requires n sup 2 integrations to obtain the element of the nth order matrix. There are, however, only n(n-1)/2 independent parameters which determine an orthogonal matrix. The questions of choosing them, finding their differential equation and expressing the orthogonal matrix in terms of these parameters are considered. Several possibilities which are based on attitude determination in three dimensions are examined. It is shown that not all 3-D methods have useful extensions to higher dimensions. It is also shown why the rate of change of the matrix elements, which are the elements of the angular rate vector in 3-D, are the elements of a tensor of the second rank (dyadic) in spaces other than three dimensional. It is proven that the 3-D Gibbs vector (or Cayley Parameters) are extendable to other dimensions. An algorithm is developed emplying the resulting parameters, which are termed Extended Rodrigues Parameters, and numerical results are presented of the application of the algorithm to a fourth order matrix.

Minimal parameter solution of the orthogonal matrix differential equation

NASA Technical Reports Server (NTRS)

Baritzhack, Itzhack Y.; Markley, F. Landis

1988-01-01

As demonstrated in this work, all orthogonal matrices solve a first order differential equation. The straightforward solution of this equation requires n sup 2 integrations to obtain the element of the nth order matrix. There are, however, only n(n-1)/2 independent parameters which determine an orthogonal matrix. The questions of choosing them, finding their differential equation and expressing the orthogonal matrix in terms of these parameters are considered. Several possibilities which are based on attitude determination in three dimensions are examined. It is shown that not all 3-D methods have useful extensions to higher dimensions. It is also shown why the rate of change of the matrix elements, which are the elements of the angular rate vector in 3-D, are the elements of a tensor of the second rank (dyadic) in spaces other than three dimensional. It is proven that the 3-D Gibbs vector (or Cayley Parameters) are extendable to other dimensions. An algorithm is developed employing the resulting parameters, which are termed Extended Rodrigues Parameters, and numerical results are presented of the application of the algorithm to a fourth order matrix.

Semiconductor spintronics: The full matrix approach

NASA Astrophysics Data System (ADS)

Rossani, A.

2015-12-01

A new model, based on an asymptotic procedure for solving the spinor kinetic equations of electrons and phonons is proposed, which gives naturally the displaced Fermi-Dirac distribution function at the leading order. The balance equations for the electron number, energy density and momentum, plus the Poisson’s equation, constitute now a system of six equations. Moreover, two equations for the evolution of the spin densities are added, which account for a general dispersion relation.

A new Jacobi spectral collocation method for solving 1+1 fractional Schrödinger equations and fractional coupled Schrödinger systems

NASA Astrophysics Data System (ADS)

Bhrawy, A. H.; Doha, E. H.; Ezz-Eldien, S. S.; Van Gorder, Robert A.

2014-12-01

The Jacobi spectral collocation method (JSCM) is constructed and used in combination with the operational matrix of fractional derivatives (described in the Caputo sense) for the numerical solution of the time-fractional Schrödinger equation (T-FSE) and the space-fractional Schrödinger equation (S-FSE). The main characteristic behind this approach is that it reduces such problems to those of solving a system of algebraic equations, which greatly simplifies the solution process. In addition, the presented approach is also applied to solve the time-fractional coupled Schrödinger system (T-FCSS). In order to demonstrate the validity and accuracy of the numerical scheme proposed, several numerical examples with their approximate solutions are presented with comparisons between our numerical results and those obtained by other methods.

Comparing direct and iterative equation solvers in a large structural analysis software system

NASA Technical Reports Server (NTRS)

Poole, E. L.

1991-01-01

Two direct Choleski equation solvers and two iterative preconditioned conjugate gradient (PCG) equation solvers used in a large structural analysis software system are described. The two direct solvers are implementations of the Choleski method for variable-band matrix storage and sparse matrix storage. The two iterative PCG solvers include the Jacobi conjugate gradient method and an incomplete Choleski conjugate gradient method. The performance of the direct and iterative solvers is compared by solving several representative structural analysis problems. Some key factors affecting the performance of the iterative solvers relative to the direct solvers are identified.

Second derivative time integration methods for discontinuous Galerkin solutions of unsteady compressible flows

NASA Astrophysics Data System (ADS)

Nigro, A.; De Bartolo, C.; Crivellini, A.; Bassi, F.

2017-12-01

In this paper we investigate the possibility of using the high-order accurate A (α) -stable Second Derivative (SD) schemes proposed by Enright for the implicit time integration of the Discontinuous Galerkin (DG) space-discretized Navier-Stokes equations. These multistep schemes are A-stable up to fourth-order, but their use results in a system matrix difficult to compute. Furthermore, the evaluation of the nonlinear function is computationally very demanding. We propose here a Matrix-Free (MF) implementation of Enright schemes that allows to obtain a method without the costs of forming, storing and factorizing the system matrix, which is much less computationally expensive than its matrix-explicit counterpart, and which performs competitively with other implicit schemes, such as the Modified Extended Backward Differentiation Formulae (MEBDF). The algorithm makes use of the preconditioned GMRES algorithm for solving the linear system of equations. The preconditioner is based on the ILU(0) factorization of an approximated but computationally cheaper form of the system matrix, and it has been reused for several time steps to improve the efficiency of the MF Newton-Krylov solver. We additionally employ a polynomial extrapolation technique to compute an accurate initial guess to the implicit nonlinear system. The stability properties of SD schemes have been analyzed by solving a linear model problem. For the analysis on the Navier-Stokes equations, two-dimensional inviscid and viscous test cases, both with a known analytical solution, are solved to assess the accuracy properties of the proposed time integration method for nonlinear autonomous and non-autonomous systems, respectively. The performance of the SD algorithm is compared with the ones obtained by using an MF-MEBDF solver, in order to evaluate its effectiveness, identifying its limitations and suggesting possible further improvements.

Multi-Dimensional Asymptotically Stable 4th Order Accurate Schemes for the Diffusion Equation

NASA Technical Reports Server (NTRS)

Abarbanel, Saul; Ditkowski, Adi

1996-01-01

An algorithm is presented which solves the multi-dimensional diffusion equation on co mplex shapes to 4th-order accuracy and is asymptotically stable in time. This bounded-error result is achieved by constructing, on a rectangular grid, a differentiation matrix whose symmetric part is negative definite. The differentiation matrix accounts for the Dirichlet boundary condition by imposing penalty like terms. Numerical examples in 2-D show that the method is effective even where standard schemes, stable by traditional definitions fail.

SOME NEW FINITE DIFFERENCE METHODS FOR HELMHOLTZ EQUATIONS ON IRREGULAR DOMAINS OR WITH INTERFACES

PubMed Central

Wan, Xiaohai; Li, Zhilin

2012-01-01

Solving a Helmholtz equation Δu + λu = f efficiently is a challenge for many applications. For example, the core part of many efficient solvers for the incompressible Navier-Stokes equations is to solve one or several Helmholtz equations. In this paper, two new finite difference methods are proposed for solving Helmholtz equations on irregular domains, or with interfaces. For Helmholtz equations on irregular domains, the accuracy of the numerical solution obtained using the existing augmented immersed interface method (AIIM) may deteriorate when the magnitude of λ is large. In our new method, we use a level set function to extend the source term and the PDE to a larger domain before we apply the AIIM. For Helmholtz equations with interfaces, a new maximum principle preserving finite difference method is developed. The new method still uses the standard five-point stencil with modifications of the finite difference scheme at irregular grid points. The resulting coefficient matrix of the linear system of finite difference equations satisfies the sign property of the discrete maximum principle and can be solved efficiently using a multigrid solver. The finite difference method is also extended to handle temporal discretized equations where the solution coefficient λ is inversely proportional to the mesh size. PMID:22701346

SOME NEW FINITE DIFFERENCE METHODS FOR HELMHOLTZ EQUATIONS ON IRREGULAR DOMAINS OR WITH INTERFACES.

PubMed

Wan, Xiaohai; Li, Zhilin

2012-06-01

Solving a Helmholtz equation Δu + λu = f efficiently is a challenge for many applications. For example, the core part of many efficient solvers for the incompressible Navier-Stokes equations is to solve one or several Helmholtz equations. In this paper, two new finite difference methods are proposed for solving Helmholtz equations on irregular domains, or with interfaces. For Helmholtz equations on irregular domains, the accuracy of the numerical solution obtained using the existing augmented immersed interface method (AIIM) may deteriorate when the magnitude of λ is large. In our new method, we use a level set function to extend the source term and the PDE to a larger domain before we apply the AIIM. For Helmholtz equations with interfaces, a new maximum principle preserving finite difference method is developed. The new method still uses the standard five-point stencil with modifications of the finite difference scheme at irregular grid points. The resulting coefficient matrix of the linear system of finite difference equations satisfies the sign property of the discrete maximum principle and can be solved efficiently using a multigrid solver. The finite difference method is also extended to handle temporal discretized equations where the solution coefficient λ is inversely proportional to the mesh size.

Second kind Chebyshev operational matrix algorithm for solving differential equations of Lane-Emden type

NASA Astrophysics Data System (ADS)

Doha, E. H.; Abd-Elhameed, W. M.; Youssri, Y. H.

2013-10-01

In this paper, we present a new second kind Chebyshev (S2KC) operational matrix of derivatives. With the aid of S2KC, an algorithm is described to obtain numerical solutions of a class of linear and nonlinear Lane-Emden type singular initial value problems (IVPs). The idea of obtaining such solutions is essentially based on reducing the differential equation with its initial conditions to a system of algebraic equations. Two illustrative examples concern relevant physical problems (the Lane-Emden equations of the first and second kind) are discussed to demonstrate the validity and applicability of the suggested algorithm. Numerical results obtained are comparing favorably with the analytical known solutions.

Modeling of outgassing and matrix decomposition in carbon-phenolic composites

NASA Technical Reports Server (NTRS)

Mcmanus, Hugh L.

1994-01-01

Work done in the period Jan. - June 1994 is summarized. Two threads of research have been followed. First, the thermodynamics approach was used to model the chemical and mechanical responses of composites exposed to high temperatures. The thermodynamics approach lends itself easily to the usage of variational principles. This thermodynamic-variational approach has been applied to the transpiration cooling problem. The second thread is the development of a better algorithm to solve the governing equations resulting from the modeling. Explicit finite difference method is explored for solving the governing nonlinear, partial differential equations. The method allows detailed material models to be included and solution on massively parallel supercomputers. To demonstrate the feasibility of the explicit scheme in solving nonlinear partial differential equations, a transpiration cooling problem was solved. Some interesting transient behaviors were captured such as stress waves and small spatial oscillations of transient pressure distribution.

Aeroelastic analysis of a troposkien-type wind turbine blade

NASA Technical Reports Server (NTRS)

Nitzsche, F.

1981-01-01

The linear aeroelastic equations for one curved blade of a vertical axis wind turbine in state vector form are presented. The method is based on a simple integrating matrix scheme together with the transfer matrix idea. The method is proposed as a convenient way of solving the associated eigenvalue problem for general support conditions.

Online gaming for learning optimal team strategies in real time

NASA Astrophysics Data System (ADS)

Hudas, Gregory; Lewis, F. L.; Vamvoudakis, K. G.

2010-04-01

This paper first presents an overall view for dynamical decision-making in teams, both cooperative and competitive. Strategies for team decision problems, including optimal control, zero-sum 2-player games (H-infinity control) and so on are normally solved for off-line by solving associated matrix equations such as the Riccati equation. However, using that approach, players cannot change their objectives online in real time without calling for a completely new off-line solution for the new strategies. Therefore, in this paper we give a method for learning optimal team strategies online in real time as team dynamical play unfolds. In the linear quadratic regulator case, for instance, the method learns the Riccati equation solution online without ever solving the Riccati equation. This allows for truly dynamical team decisions where objective functions can change in real time and the system dynamics can be time-varying.

An efficient numerical model for multicomponent compressible flow in fractured porous media

NASA Astrophysics Data System (ADS)

Zidane, Ali; Firoozabadi, Abbas

2014-12-01

An efficient and accurate numerical model for multicomponent compressible single-phase flow in fractured media is presented. The discrete-fracture approach is used to model the fractures where the fracture entities are described explicitly in the computational domain. We use the concept of cross flow equilibrium in the fractures. This will allow large matrix elements in the neighborhood of the fractures and considerable speed up of the algorithm. We use an implicit finite volume (FV) scheme to solve the species mass balance equation in the fractures. This step avoids the use of Courant-Freidricks-Levy (CFL) condition and contributes to significant speed up of the code. The hybrid mixed finite element method (MFE) is used to solve for the velocity in both the matrix and the fractures coupled with the discontinuous Galerkin (DG) method to solve the species transport equations in the matrix. Four numerical examples are presented to demonstrate the robustness and efficiency of the proposed model. We show that the combination of the fracture cross-flow equilibrium and the implicit composition calculation in the fractures increase the computational speed 20-130 times in 2D. In 3D, one may expect even a higher computational efficiency.

Simulation of RF-fields in a fusion device

DOE Office of Scientific and Technical Information (OSTI.GOV)

De Witte, Dieter; Bogaert, Ignace; De Zutter, Daniel

2009-11-26

In this paper the problem of scattering off a fusion plasma is approached from the point of view of integral equations. Using the volume equivalence principle an integral equation is derived which describes the electromagnetic fields in a plasma. The equation is discretized with MoM using conforming basis functions. This reduces the problem to solving a dense matrix equation. This can be done iteratively. Each iteration can be sped up using FFTs.

The accurate solution of Poisson's equation by expansion in Chebyshev polynomials

NASA Technical Reports Server (NTRS)

Haidvogel, D. B.; Zang, T.

1979-01-01

A Chebyshev expansion technique is applied to Poisson's equation on a square with homogeneous Dirichlet boundary conditions. The spectral equations are solved in two ways - by alternating direction and by matrix diagonalization methods. Solutions are sought to both oscillatory and mildly singular problems. The accuracy and efficiency of the Chebyshev approach compare favorably with those of standard second- and fourth-order finite-difference methods.

Effective Methods for Solving Band SLEs after Parabolic Nonlinear PDEs

NASA Astrophysics Data System (ADS)

Veneva, Milena; Ayriyan, Alexander

2018-04-01

A class of models of heat transfer processes in a multilayer domain is considered. The governing equation is a nonlinear heat-transfer equation with different temperature-dependent densities and thermal coefficients in each layer. Homogeneous Neumann boundary conditions and ideal contact ones are applied. A finite difference scheme on a special uneven mesh with a second-order approximation in the case of a piecewise constant spatial step is built. This discretization leads to a pentadiagonal system of linear equations (SLEs) with a matrix which is neither diagonally dominant, nor positive definite. Two different methods for solving such a SLE are developed - diagonal dominantization and symbolic algorithms.

Matrix decomposition graphics processing unit solver for Poisson image editing

NASA Astrophysics Data System (ADS)

Lei, Zhao; Wei, Li

2012-10-01

In recent years, gradient-domain methods have been widely discussed in the image processing field, including seamless cloning and image stitching. These algorithms are commonly carried out by solving a large sparse linear system: the Poisson equation. However, solving the Poisson equation is a computational and memory intensive task which makes it not suitable for real-time image editing. A new matrix decomposition graphics processing unit (GPU) solver (MDGS) is proposed to settle the problem. A matrix decomposition method is used to distribute the work among GPU threads, so that MDGS will take full advantage of the computing power of current GPUs. Additionally, MDGS is a hybrid solver (combines both the direct and iterative techniques) and has two-level architecture. These enable MDGS to generate identical solutions with those of the common Poisson methods and achieve high convergence rate in most cases. This approach is advantageous in terms of parallelizability, enabling real-time image processing, low memory-taken and extensive applications.

Classical r matrix of the su(2 vertical bar 2) super Yang-Mills spin chain

DOE Office of Scientific and Technical Information (OSTI.GOV)

Torrielli, Alessandro

2007-05-15

In this note we straightforwardly derive and make use of the quantum R matrix for the su(2 vertical bar 2) super Yang-Mills spin chain in the manifest su(1 vertical bar 2)-invariant formulation, which solves the standard quantum Yang-Baxter equation, in order to obtain the correspondent (undressed) classical r matrix from the first order expansion in the 'deformation' parameter 2{pi}/{radical}({lambda}) and check that this last solves the standard classical Yang-Baxter equation. We analyze its bialgebra structure, its dependence on the spectral parameters, and its pole structure. We notice that it still preserves an su(1 vertical bar 2) subalgebra, thereby admitting anmore » expression in terms of a combination of projectors, which spans only a subspace of su(1 vertical bar 2)xsu(1 vertical bar 2). We study the residue at its simple pole at the origin and comment on the applicability of the classical Belavin-Drinfeld type of analysis.« less

A modified dual-level algorithm for large-scale three-dimensional Laplace and Helmholtz equation

NASA Astrophysics Data System (ADS)

Li, Junpu; Chen, Wen; Fu, Zhuojia

2018-01-01

A modified dual-level algorithm is proposed in the article. By the help of the dual level structure, the fully-populated interpolation matrix on the fine level is transformed to a local supported sparse matrix to solve the highly ill-conditioning and excessive storage requirement resulting from fully-populated interpolation matrix. The kernel-independent fast multipole method is adopted to expediting the solving process of the linear equations on the coarse level. Numerical experiments up to 2-million fine-level nodes have successfully been achieved. It is noted that the proposed algorithm merely needs to place 2-3 coarse-level nodes in each wavelength per direction to obtain the reasonable solution, which almost down to the minimum requirement allowed by the Shannon's sampling theorem. In the real human head model example, it is observed that the proposed algorithm can simulate well computationally very challenging exterior high-frequency harmonic acoustic wave propagation up to 20,000 Hz.

A linear programming manual

NASA Technical Reports Server (NTRS)

Tuey, R. C.

1972-01-01

Computer solutions of linear programming problems are outlined. Information covers vector spaces, convex sets, and matrix algebra elements for solving simultaneous linear equations. Dual problems, reduced cost analysis, ranges, and error analysis are illustrated.

Two-dimensional computer simulation of EMVJ and grating solar cells under AMO illumination

NASA Technical Reports Server (NTRS)

Gray, J. L.; Schwartz, R. J.

1984-01-01

A computer program, SCAP2D (Solar Cell Analysis Program in 2-Dimensions), is used to evaluate the Etched Multiple Vertical Junction (EMVJ) and grating solar cells. The aim is to demonstrate how SCAP2D can be used to evaluate cell designs. The cell designs studied are by no means optimal designs. The SCAP2D program solves the three coupled, nonlinear partial differential equations, Poisson's Equation and the hole and electron continuity equations, simultaneously in two-dimensions using finite differences to discretize the equations and Newton's Method to linearize them. The variables solved for are the electrostatic potential and the hole and electron concentrations. Each linear system of equations is solved directly by Gaussian Elimination. Convergence of the Newton Iteration is assumed when the largest correction to the electrostatic potential or hole or electron quasi-potential is less than some predetermined error. A typical problem involves 2000 nodes with a Jacobi matrix of order 6000 and a bandwidth of 243.

Nonlinear recurrent neural networks for finite-time solution of general time-varying linear matrix equations.

PubMed

Xiao, Lin; Liao, Bolin; Li, Shuai; Chen, Ke

2018-02-01

In order to solve general time-varying linear matrix equations (LMEs) more efficiently, this paper proposes two nonlinear recurrent neural networks based on two nonlinear activation functions. According to Lyapunov theory, such two nonlinear recurrent neural networks are proved to be convergent within finite-time. Besides, by solving differential equation, the upper bounds of the finite convergence time are determined analytically. Compared with existing recurrent neural networks, the proposed two nonlinear recurrent neural networks have a better convergence property (i.e., the upper bound is lower), and thus the accurate solutions of general time-varying LMEs can be obtained with less time. At last, various different situations have been considered by setting different coefficient matrices of general time-varying LMEs and a great variety of computer simulations (including the application to robot manipulators) have been conducted to validate the better finite-time convergence of the proposed two nonlinear recurrent neural networks. Copyright © 2017 Elsevier Ltd. All rights reserved.

Three dimensional iterative beam propagation method for optical waveguide devices

NASA Astrophysics Data System (ADS)

Ma, Changbao; Van Keuren, Edward

2006-10-01

The finite difference beam propagation method (FD-BPM) is an effective model for simulating a wide range of optical waveguide structures. The classical FD-BPMs are based on the Crank-Nicholson scheme, and in tridiagonal form can be solved using the Thomas method. We present a different type of algorithm for 3-D structures. In this algorithm, the wave equation is formulated into a large sparse matrix equation which can be solved using iterative methods. The simulation window shifting scheme and threshold technique introduced in our earlier work are utilized to overcome the convergence problem of iterative methods for large sparse matrix equation and wide-angle simulations. This method enables us to develop higher-order 3-D wide-angle (WA-) BPMs based on Pade approximant operators and the multistep method, which are commonly used in WA-BPMs for 2-D structures. Simulations using the new methods will be compared to the analytical results to assure its effectiveness and applicability.

On linearization and preconditioning for radiation diffusion coupled to material thermal conduction equations

DOE Office of Scientific and Technical Information (OSTI.GOV)

Feng, Tao, E-mail: fengtao2@mail.ustc.edu.cn; Graduate School of China Academy Engineering Physics, Beijing 100083; An, Hengbin, E-mail: an_hengbin@iapcm.ac.cn

2013-03-01

Jacobian-free Newton–Krylov (JFNK) method is an effective algorithm for solving large scale nonlinear equations. One of the most important advantages of JFNK method is that there is no necessity to form and store the Jacobian matrix of the nonlinear system when JFNK method is employed. However, an approximation of the Jacobian is needed for the purpose of preconditioning. In this paper, JFNK method is employed to solve a class of non-equilibrium radiation diffusion coupled to material thermal conduction equations, and two preconditioners are designed by linearizing the equations in two methods. Numerical results show that the two preconditioning methods canmore » improve the convergence behavior and efficiency of JFNK method.« less

Efficient and robust compositional two-phase reservoir simulation in fractured media

NASA Astrophysics Data System (ADS)

Zidane, A.; Firoozabadi, A.

2015-12-01

Compositional and compressible two-phase flow in fractured media has wide applications including CO2 injection. Accurate simulations are currently based on the discrete fracture approach using the cross-flow equilibrium model. In this approach the fractures and a small part of the matrix blocks are combined to form a grid cell. The major drawback is low computational efficiency. In this work we use the discrete-fracture approach to model the fractures where the fracture entities are described explicitly in the computational domain. We use the concept of cross-flow equilibrium in the fractures (FCFE). This allows using large matrix elements in the neighborhood of the fractures. We solve the fracture transport equations implicitly to overcome the Courant-Freidricks-Levy (CFL) condition in the small fracture elements. Our implicit approach is based on calculation of the derivative of the molar concentration of component i in phase (cαi ) with respect to the total molar concentration (ci ) at constant volume V and temperature T. This contributes to significant speed up of the code. The hybrid mixed finite element method (MFE) is used to solve for the velocity in both the matrix and the fractures coupled with the discontinuous Galerkin (DG) method to solve the species transport equations in the matrix, and a finite volume (FV) discretization in the fractures. In large scale problems the proposed approach is orders of magnitude faster than the existing models.

Unitary-matrix models as exactly solvable string theories

NASA Technical Reports Server (NTRS)

Periwal, Vipul; Shevitz, Danny

1990-01-01

Exact differential equations are presently found for the scaling functions of models of unitary matrices which are solved in a double-scaling limit, using orthogonal polynomials on a circle. For the case of the simplest, k = 1 model, the Painleve II equation with constant 0 is obtained; possible nonperturbative phase transitions exist for these models. Equations are presented for k = 2 and 3, and discussed with a view to asymptotic behavior.

Elementary solutions of coupled model equations in the kinetic theory of gases

NASA Technical Reports Server (NTRS)

Kriese, J. T.; Siewert, C. E.; Chang, T. S.

1974-01-01

The method of elementary solutions is employed to solve two coupled integrodifferential equations sufficient for determining temperature-density effects in a linearized BGK model in the kinetic theory of gases. Full-range completeness and orthogonality theorems are proved for the developed normal modes and the infinite-medium Green's function is constructed as an illustration of the full-range formalism. The appropriate homogeneous matrix Riemann problem is discussed, and half-range completeness and orthogonality theorems are proved for a certain subset of the normal modes. The required existence and uniqueness theorems relevant to the H matrix, basic to the half-range analysis, are proved, and an accurate and efficient computational method is discussed. The half-space temperature-slip problem is solved analytically, and a highly accurate value of the temperature-slip coefficient is reported.

Block recursive LU preconditioners for the thermally coupled incompressible inductionless MHD problem

NASA Astrophysics Data System (ADS)

Badia, Santiago; Martín, Alberto F.; Planas, Ramon

2014-10-01

The thermally coupled incompressible inductionless magnetohydrodynamics (MHD) problem models the flow of an electrically charged fluid under the influence of an external electromagnetic field with thermal coupling. This system of partial differential equations is strongly coupled and highly nonlinear for real cases of interest. Therefore, fully implicit time integration schemes are very desirable in order to capture the different physical scales of the problem at hand. However, solving the multiphysics linear systems of equations resulting from such algorithms is a very challenging task which requires efficient and scalable preconditioners. In this work, a new family of recursive block LU preconditioners is designed and tested for solving the thermally coupled inductionless MHD equations. These preconditioners are obtained after splitting the fully coupled matrix into one-physics problems for every variable (velocity, pressure, current density, electric potential and temperature) that can be optimally solved, e.g., using preconditioned domain decomposition algorithms. The main idea is to arrange the original matrix into an (arbitrary) 2 × 2 block matrix, and consider an LU preconditioner obtained by approximating the corresponding Schur complement. For every one of the diagonal blocks in the LU preconditioner, if it involves more than one type of unknowns, we proceed the same way in a recursive fashion. This approach is stated in an abstract way, and can be straightforwardly applied to other multiphysics problems. Further, we precisely explain a flexible and general software design for the code implementation of this type of preconditioners.

Solving the hypersingular boundary integral equation in three-dimensional acoustics using a regularization relationship.

PubMed

Yan, Zai You; Hung, Kin Chew; Zheng, Hui

2003-05-01

Regularization of the hypersingular integral in the normal derivative of the conventional Helmholtz integral equation through a double surface integral method or regularization relationship has been studied. By introducing the new concept of discretized operator matrix, evaluation of the double surface integrals is reduced to calculate the product of two discretized operator matrices. Such a treatment greatly improves the computational efficiency. As the number of frequencies to be computed increases, the computational cost of solving the composite Helmholtz integral equation is comparable to that of solving the conventional Helmholtz integral equation. In this paper, the detailed formulation of the proposed regularization method is presented. The computational efficiency and accuracy of the regularization method are demonstrated for a general class of acoustic radiation and scattering problems. The radiation of a pulsating sphere, an oscillating sphere, and a rigid sphere insonified by a plane acoustic wave are solved using the new method with curvilinear quadrilateral isoparametric elements. It is found that the numerical results rapidly converge to the corresponding analytical solutions as finer meshes are applied.

Solution of weakly compressible isothermal flow in landfill gas collection networks

NASA Astrophysics Data System (ADS)

Nec, Y.; Huculak, G.

2017-12-01

Pipe networks collecting gas in sanitary landfills operate under the regime of a weakly compressible isothermal flow of ideal gas. The effect of compressibility has been traditionally neglected in this application in favour of simplicity, thereby creating a conceptual incongruity between the flow equations and thermodynamic equation of state. Here the flow is solved by generalisation of the classic Darcy-Weisbach equation for an incompressible steady flow in a pipe to an ordinary differential equation, permitting continuous variation of density, viscosity and related fluid parameters, as well as head loss or gain due to gravity, in isothermal flow. The differential equation is solved analytically in the case of ideal gas for a single edge in the network. Thereafter the solution is used in an algorithm developed to construct the flow equations automatically for a network characterised by an incidence matrix, and determine pressure distribution, flow rates and all associated parameters therein.

Incompressible spectral-element method: Derivation of equations

NASA Technical Reports Server (NTRS)

Deanna, Russell G.

1993-01-01

A fractional-step splitting scheme breaks the full Navier-Stokes equations into explicit and implicit portions amenable to the calculus of variations. Beginning with the functional forms of the Poisson and Helmholtz equations, we substitute finite expansion series for the dependent variables and derive the matrix equations for the unknown expansion coefficients. This method employs a new splitting scheme which differs from conventional three-step (nonlinear, pressure, viscous) schemes. The nonlinear step appears in the conventional, explicit manner, the difference occurs in the pressure step. Instead of solving for the pressure gradient using the nonlinear velocity, we add the viscous portion of the Navier-Stokes equation from the previous time step to the velocity before solving for the pressure gradient. By combining this 'predicted' pressure gradient with the nonlinear velocity in an explicit term, and the Crank-Nicholson method for the viscous terms, we develop a Helmholtz equation for the final velocity.

Calculation of normal modes of the closed waveguides in general vector case

NASA Astrophysics Data System (ADS)

Malykh, M. D.; Sevastianov, L. A.; Tiutiunnik, A. A.

2018-04-01

The article is devoted to the calculation of normal modes of the closed waveguides with an arbitrary filling ɛ, μ in the system of computer algebra Sage. Maxwell equations in the cylinder are reduced to the system of two bounded Helmholtz equations, the notion of weak solution of this system is given and then this system is investigated as a system of ordinary differential equations. The normal modes of this system are an eigenvectors of a matrix pencil. We suggest to calculate the matrix elements approximately and to truncate the matrix by usual way but further to solve the truncated eigenvalue problem exactly in the field of algebraic numbers. This approach allows to keep the symmetry of the initial problem and in particular the multiplicity of the eigenvalues. In the work would be presented some results of calculations.

The Green's matrix and the boundary integral equations for analysis of time-harmonic dynamics of elastic helical springs.

PubMed

Sorokin, Sergey V

2011-03-01

Helical springs serve as vibration isolators in virtually any suspension system. Various exact and approximate methods may be employed to determine the eigenfrequencies of vibrations of these structural elements and their dynamic transfer functions. The method of boundary integral equations is a meaningful alternative to obtain exact solutions of problems of the time-harmonic dynamics of elastic springs in the framework of Bernoulli-Euler beam theory. In this paper, the derivations of the Green's matrix, of the Somigliana's identities, and of the boundary integral equations are presented. The vibrational power transmission in an infinitely long spring is analyzed by means of the Green's matrix. The eigenfrequencies and the dynamic transfer functions are found by solving the boundary integral equations. In the course of analysis, the essential features and advantages of the method of boundary integral equations are highlighted. The reported analytical results may be used to study the time-harmonic motion in any wave guide governed by a system of linear differential equations in a single spatial coordinate along its axis. © 2011 Acoustical Society of America

A split band-Cholesky equation solving strategy for finite element analysis of transient field problems. [in fluid mechanics

NASA Technical Reports Server (NTRS)

Cooke, C. H.

1978-01-01

The paper describes the split-Cholesky strategy for banded matrices arising from the large systems of equations in certain fluid mechanics problems. The basic idea is that for a banded matrix the computation can be carried out in pieces, with only a small portion of the matrix residing in core. Mesh considerations are discussed by demonstrating the manner in which the assembly of finite element equations proceeds for linear trial functions on a triangular mesh. The FORTRAN code which implements the out-of-core decomposition strategy for banded symmetric positive definite matrices (mass matrices) of a coupled initial value problem is given.

Tensor-GMRES method for large sparse systems of nonlinear equations

NASA Technical Reports Server (NTRS)

Feng, Dan; Pulliam, Thomas H.

1994-01-01

This paper introduces a tensor-Krylov method, the tensor-GMRES method, for large sparse systems of nonlinear equations. This method is a coupling of tensor model formation and solution techniques for nonlinear equations with Krylov subspace projection techniques for unsymmetric systems of linear equations. Traditional tensor methods for nonlinear equations are based on a quadratic model of the nonlinear function, a standard linear model augmented by a simple second order term. These methods are shown to be significantly more efficient than standard methods both on nonsingular problems and on problems where the Jacobian matrix at the solution is singular. A major disadvantage of the traditional tensor methods is that the solution of the tensor model requires the factorization of the Jacobian matrix, which may not be suitable for problems where the Jacobian matrix is large and has a 'bad' sparsity structure for an efficient factorization. We overcome this difficulty by forming and solving the tensor model using an extension of a Newton-GMRES scheme. Like traditional tensor methods, we show that the new tensor method has significant computational advantages over the analogous Newton counterpart. Consistent with Krylov subspace based methods, the new tensor method does not depend on the factorization of the Jacobian matrix. As a matter of fact, the Jacobian matrix is never needed explicitly.

Heat and Mass Transfer in an L Shaped Porous Medium

NASA Astrophysics Data System (ADS)

Salman Ahmed, N. J.; Azeem; Yunus Khan, T. M.

2017-08-01

This article is an extension to the heat transfer in L-shaped porous medium by including the mass diffusion. The heat and mass transfer in the porous domain is represented by three coupled partial differential equations representing the fluid movement, energy transport and mass transport. The equations are converted into algebraic form of equations by the application of finite element method that can be conveniently solved by matrix method. An iterative approach is adopted to solve the coupled equations by setting suitable convergence criterion. The results are discussed in terms of heat transfer characteristics influenced by physical parameters such as buoyancy ratio, Lewis number, Rayleigh number etc. It is found that these physical parameters have significant effect on heat and mass transfer behavior of L-shaped porous medium.

An efficient computational method for solving nonlinear stochastic Itô integral equations: Application for stochastic problems in physics

DOE Office of Scientific and Technical Information (OSTI.GOV)

Heydari, M.H., E-mail: heydari@stu.yazd.ac.ir; The Laboratory of Quantum Information Processing, Yazd University, Yazd; Hooshmandasl, M.R., E-mail: hooshmandasl@yazd.ac.ir

Because of the nonlinearity, closed-form solutions of many important stochastic functional equations are virtually impossible to obtain. Thus, numerical solutions are a viable alternative. In this paper, a new computational method based on the generalized hat basis functions together with their stochastic operational matrix of Itô-integration is proposed for solving nonlinear stochastic Itô integral equations in large intervals. In the proposed method, a new technique for computing nonlinear terms in such problems is presented. The main advantage of the proposed method is that it transforms problems under consideration into nonlinear systems of algebraic equations which can be simply solved. Errormore » analysis of the proposed method is investigated and also the efficiency of this method is shown on some concrete examples. The obtained results reveal that the proposed method is very accurate and efficient. As two useful applications, the proposed method is applied to obtain approximate solutions of the stochastic population growth models and stochastic pendulum problem.« less

Some optimal considerations in attitude control systems. [evaluation of value of relative weighting between time and fuel for relay control law

NASA Technical Reports Server (NTRS)

Boland, J. S., III

1973-01-01

The conventional six-engine reaction control jet relay attitude control law with deadband is shown to be a good linear approximation to a weighted time-fuel optimal control law. Techniques for evaluating the value of the relative weighting between time and fuel for a particular relay control law is studied along with techniques to interrelate other parameters for the two control laws. Vehicle attitude control laws employing control moment gyros are then investigated. Steering laws obtained from the expression for the reaction torque of the gyro configuration are compared to a total optimal attitude control law that is derived from optimal linear regulator theory. This total optimal attitude control law has computational disadvantages in the solving of the matrix Riccati equation. Several computational algorithms for solving the matrix Riccati equation are investigated with respect to accuracy, computational storage requirements, and computational speed.

A model for cell migration in non-isotropic fibrin networks with an application to pancreatic tumor islets.

PubMed

Chen, Jiao; Weihs, Daphne; Vermolen, Fred J

2018-04-01

Cell migration, known as an orchestrated movement of cells, is crucially important for wound healing, tumor growth, immune response as well as other biomedical processes. This paper presents a cell-based model to describe cell migration in non-isotropic fibrin networks around pancreatic tumor islets. This migration is determined by the mechanical strain energy density as well as cytokines-driven chemotaxis. Cell displacement is modeled by solving a large system of ordinary stochastic differential equations where the stochastic parts result from random walk. The stochastic differential equations are solved by the use of the classical Euler-Maruyama method. In this paper, the influence of anisotropic stromal extracellular matrix in pancreatic tumor islets on T-lymphocytes migration in different immune systems is investigated. As a result, tumor peripheral stromal extracellular matrix impedes the immune response of T-lymphocytes through changing direction of their migration.

Multiscale model reduction for shale gas transport in poroelastic fractured media

NASA Astrophysics Data System (ADS)

Akkutlu, I. Yucel; Efendiev, Yalchin; Vasilyeva, Maria; Wang, Yuhe

2018-01-01

Inherently coupled flow and geomechanics processes in fractured shale media have implications for shale gas production. The system involves highly complex geo-textures comprised of a heterogeneous anisotropic fracture network spatially embedded in an ultra-tight matrix. In addition, nonlinearities due to viscous flow, diffusion, and desorption in the matrix and high velocity gas flow in the fractures complicates the transport. In this paper, we develop a multiscale model reduction approach to couple gas flow and geomechanics in fractured shale media. A Discrete Fracture Model (DFM) is used to treat the complex network of fractures on a fine grid. The coupled flow and geomechanics equations are solved using a fixed stress-splitting scheme by solving the pressure equation using a continuous Galerkin method and the displacement equation using an interior penalty discontinuous Galerkin method. We develop a coarse grid approximation and coupling using the Generalized Multiscale Finite Element Method (GMsFEM). GMsFEM constructs the multiscale basis functions in a systematic way to capture the fracture networks and their interactions with the shale matrix. Numerical results and an error analysis is provided showing that the proposed approach accurately captures the coupled process using a few multiscale basis functions, i.e. a small fraction of the degrees of freedom of the fine-scale problem.

Reexamination of relaxation of spins due to a magnetic field gradient: Identity of the Redfield and Torrey theories

DOE Office of Scientific and Technical Information (OSTI.GOV)

Golub, R.; Rohm, Ryan M.; Swank, C. M.

2011-02-15

There is an extensive literature on magnetic-gradient-induced spin relaxation. Cates, Schaefer, and Happer, in a seminal publication, have solved the problem in the regime where diffusion theory (the Torrey equation) is applicable using an expansion of the density matrix in diffusion equation eigenfunctions and angular momentum tensors. McGregor has solved the problem in the same regime using a slightly more general formulation using the Redfield theory formulated in terms of the autocorrelation function of the fluctuating field seen by the spins and calculating the correlation functions using the diffusion-theory Green's function. The results of both calculations were shown to agreemore » for a special case. In the present work, we show that the eigenfunction expansion of the Torrey equation yields the expansion of the Green's function for the diffusion equation, thus showing the identity of this approach with that of the Redfield theory. The general solution can also be obtained directly from the Torrey equation for the density matrix. Thus, the physical content of the Redfield and Torrey approaches are identical. We then introduce a more general expression for the position autocorrelation function of particles moving in a closed cell, extending the range of applicability of the theory.« less

A Legendre tau-spectral method for solving time-fractional heat equation with nonlocal conditions.

PubMed

Bhrawy, A H; Alghamdi, M A

2014-01-01

We develop the tau-spectral method to solve the time-fractional heat equation (T-FHE) with nonlocal condition. In order to achieve highly accurate solution of this problem, the operational matrix of fractional integration (described in the Riemann-Liouville sense) for shifted Legendre polynomials is investigated in conjunction with tau-spectral scheme and the Legendre operational polynomials are used as the base function. The main advantage in using the presented scheme is that it converts the T-FHE with nonlocal condition to a system of algebraic equations that simplifies the problem. For demonstrating the validity and applicability of the developed spectral scheme, two numerical examples are presented. The logarithmic graphs of the maximum absolute errors is presented to achieve the exponential convergence of the proposed method. Comparing between our spectral method and other methods ensures that our method is more accurate than those solved similar problem.

A Legendre tau-Spectral Method for Solving Time-Fractional Heat Equation with Nonlocal Conditions

PubMed Central

Bhrawy, A. H.; Alghamdi, M. A.

2014-01-01

We develop the tau-spectral method to solve the time-fractional heat equation (T-FHE) with nonlocal condition. In order to achieve highly accurate solution of this problem, the operational matrix of fractional integration (described in the Riemann-Liouville sense) for shifted Legendre polynomials is investigated in conjunction with tau-spectral scheme and the Legendre operational polynomials are used as the base function. The main advantage in using the presented scheme is that it converts the T-FHE with nonlocal condition to a system of algebraic equations that simplifies the problem. For demonstrating the validity and applicability of the developed spectral scheme, two numerical examples are presented. The logarithmic graphs of the maximum absolute errors is presented to achieve the exponential convergence of the proposed method. Comparing between our spectral method and other methods ensures that our method is more accurate than those solved similar problem. PMID:25057507

Linear solver performance in elastoplastic problem solution on GPU cluster

NASA Astrophysics Data System (ADS)

Khalevitsky, Yu. V.; Konovalov, A. V.; Burmasheva, N. V.; Partin, A. S.

2017-12-01

Applying the finite element method to severe plastic deformation problems involves solving linear equation systems. While the solution procedure is relatively hard to parallelize and computationally intensive by itself, a long series of large scale systems need to be solved for each problem. When dealing with fine computational meshes, such as in the simulations of three-dimensional metal matrix composite microvolume deformation, tens and hundreds of hours may be needed to complete the whole solution procedure, even using modern supercomputers. In general, one of the preconditioned Krylov subspace methods is used in a linear solver for such problems. The method convergence highly depends on the operator spectrum of a problem stiffness matrix. In order to choose the appropriate method, a series of computational experiments is used. Different methods may be preferable for different computational systems for the same problem. In this paper we present experimental data obtained by solving linear equation systems from an elastoplastic problem on a GPU cluster. The data can be used to substantiate the choice of the appropriate method for a linear solver to use in severe plastic deformation simulations.

A radial basis function Galerkin method for inhomogeneous nonlocal diffusion

DOE PAGES

Lehoucq, Richard B.; Rowe, Stephen T.

2016-02-01

We introduce a discretization for a nonlocal diffusion problem using a localized basis of radial basis functions. The stiffness matrix entries are assembled by a special quadrature routine unique to the localized basis. Combining the quadrature method with the localized basis produces a well-conditioned, sparse, symmetric positive definite stiffness matrix. We demonstrate that both the continuum and discrete problems are well-posed and present numerical results for the convergence behavior of the radial basis function method. As a result, we explore approximating the solution to anisotropic differential equations by solving anisotropic nonlocal integral equations using the radial basis function method.

An implicit iterative algorithm with a tuning parameter for Itô Lyapunov matrix equations

NASA Astrophysics Data System (ADS)

Zhang, Ying; Wu, Ai-Guo; Sun, Hui-Jie

2018-01-01

In this paper, an implicit iterative algorithm is proposed for solving a class of Lyapunov matrix equations arising in Itô stochastic linear systems. A tuning parameter is introduced in this algorithm, and thus the convergence rate of the algorithm can be changed. Some conditions are presented such that the developed algorithm is convergent. In addition, an explicit expression is also derived for the optimal tuning parameter, which guarantees that the obtained algorithm achieves its fastest convergence rate. Finally, numerical examples are employed to illustrate the effectiveness of the given algorithm.

Classical r-matrices for the generalised Chern–Simons formulation of 3d gravity

NASA Astrophysics Data System (ADS)

Osei, Prince K.; Schroers, Bernd J.

2018-04-01

We study the conditions for classical r-matrices to be compatible with the generalised Chern–Simons action for 3d gravity. Compatibility means solving the classical Yang–Baxter equations with a prescribed symmetric part for each of the real Lie algebras and bilinear pairings arising in the generalised Chern–Simons action. We give a new construction of r-matrices via a generalised complexification and derive a non-linear set of matrix equations determining the most general compatible r-matrix. We exhibit new families of solutions and show that they contain some known r-matrices for special parameter values.

Computationally Efficient Modeling and Simulation of Large Scale Systems

NASA Technical Reports Server (NTRS)

Jain, Jitesh (Inventor); Koh, Cheng-Kok (Inventor); Balakrishnan, Vankataramanan (Inventor); Cauley, Stephen F (Inventor); Li, Hong (Inventor)

2014-01-01

A system for simulating operation of a VLSI interconnect structure having capacitive and inductive coupling between nodes thereof, including a processor, and a memory, the processor configured to perform obtaining a matrix X and a matrix Y containing different combinations of passive circuit element values for the interconnect structure, the element values for each matrix including inductance L and inverse capacitance P, obtaining an adjacency matrix A associated with the interconnect structure, storing the matrices X, Y, and A in the memory, and performing numerical integration to solve first and second equations.

Extended Krylov subspaces approximations of matrix functions. Application to computational electromagnetics

DOE Office of Scientific and Technical Information (OSTI.GOV)

Druskin, V.; Lee, Ping; Knizhnerman, L.

There is now a growing interest in the area of using Krylov subspace approximations to compute the actions of matrix functions. The main application of this approach is the solution of ODE systems, obtained after discretization of partial differential equations by method of lines. In the event that the cost of computing the matrix inverse is relatively inexpensive, it is sometimes attractive to solve the ODE using the extended Krylov subspaces, originated by actions of both positive and negative matrix powers. Examples of such problems can be found frequently in computational electromagnetics.

Carbon isotope composition of ambient CO2 and recycling: a matrix simulation model

USGS Publications Warehouse

da Silveira Lobo Sternberg, Leonel; DeAngelis, Donald L.

2002-01-01

The relationship between isotopic composition and concentration of ambient CO2 in a canopy and its associated convective boundary layer was modeled. The model divides the canopy and convective boundary layer into several layers. Photosynthesis, respiration, and exchange between each layer can be simulated by matrix equations. This simulation can be used to calculate recycling; defined here as the amount of respired CO2 re-fixed by photosynthesis relative to the total amount of respired CO2. At steady state the matrix equations can be solved for the canopy and convective boundary layer CO2 concentration and isotopic profile, which can be used to calculate a theoretical recycling index according to a previously developed equation. There is complete agreement between simulated and theoretical recycling indices for different exchange scenarios. Recycling indices from a simulation of gas exchange between a heterogeneous vegetation canopy and the troposphere also agreed with a more generalized form of the theoretical recycling equation developed here.

ORACLS: A system for linear-quadratic-Gaussian control law design

NASA Technical Reports Server (NTRS)

Armstrong, E. S.

1978-01-01

A modern control theory design package (ORACLS) for constructing controllers and optimal filters for systems modeled by linear time-invariant differential or difference equations is described. Numerical linear-algebra procedures are used to implement the linear-quadratic-Gaussian (LQG) methodology of modern control theory. Algorithms are included for computing eigensystems of real matrices, the relative stability of a matrix, factored forms for nonnegative definite matrices, the solutions and least squares approximations to the solutions of certain linear matrix algebraic equations, the controllability properties of a linear time-invariant system, and the steady state covariance matrix of an open-loop stable system forced by white noise. Subroutines are provided for solving both the continuous and discrete optimal linear regulator problems with noise free measurements and the sampled-data optimal linear regulator problem. For measurement noise, duality theory and the optimal regulator algorithms are used to solve the continuous and discrete Kalman-Bucy filter problems. Subroutines are also included which give control laws causing the output of a system to track the output of a prescribed model.

Sensitivity Equation Derivation for Transient Heat Transfer Problems

NASA Technical Reports Server (NTRS)

Hou, Gene; Chien, Ta-Cheng; Sheen, Jeenson

2004-01-01

The focus of the paper is on the derivation of sensitivity equations for transient heat transfer problems modeled by different discretization processes. Two examples will be used in this study to facilitate the discussion. The first example is a coupled, transient heat transfer problem that simulates the press molding process in fabrication of composite laminates. These state equations are discretized into standard h-version finite elements and solved by a multiple step, predictor-corrector scheme. The sensitivity analysis results based upon the direct and adjoint variable approaches will be presented. The second example is a nonlinear transient heat transfer problem solved by a p-version time-discontinuous Galerkin's Method. The resulting matrix equation of the state equation is simply in the form of Ax = b, representing a single step, time marching scheme. A direct differentiation approach will be used to compute the thermal sensitivities of a sample 2D problem.

The entrainment matrix of a superfluid nucleon mixture at finite temperatures

NASA Astrophysics Data System (ADS)

Leinson, Lev B.

2018-06-01

It is considered a closed system of non-linear equations for the entrainment matrix of a non-relativistic mixture of superfluid nucleons at arbitrary temperatures below the onset of neutron superfluidity, which takes into account the essential dependence of the superfluid energy gap in the nucleon spectra on the velocities of superfluid flows. It is assumed that the protons condense into the isotropic 1S0 state, and the neutrons are paired into the spin-triplet 3P2 state. It is derived an analytic solution to the non-linear equations for the entrainment matrix under temperatures just below the critical value for the neutron superfluidity onset. In general case of an arbitrary temperature of the superfluid mixture the non-linear equations are solved numerically and fitted by simple formulas convenient for a practical use with an arbitrary set of the Landau parameters.

An Efficient Multiscale Finite-Element Method for Frequency-Domain Seismic Wave Propagation

DOE PAGES

Gao, Kai; Fu, Shubin; Chung, Eric T.

2018-02-13

The frequency-domain seismic-wave equation, that is, the Helmholtz equation, has many important applications in seismological studies, yet is very challenging to solve, particularly for large geological models. Iterative solvers, domain decomposition, or parallel strategies can partially alleviate the computational burden, but these approaches may still encounter nontrivial difficulties in complex geological models where a sufficiently fine mesh is required to represent the fine-scale heterogeneities. We develop a novel numerical method to solve the frequency-domain acoustic wave equation on the basis of the multiscale finite-element theory. We discretize a heterogeneous model with a coarse mesh and employ carefully constructed high-order multiscalemore » basis functions to form the basis space for the coarse mesh. Solved from medium- and frequency-dependent local problems, these multiscale basis functions can effectively capture themedium’s fine-scale heterogeneity and the source’s frequency information, leading to a discrete system matrix with a much smaller dimension compared with those from conventional methods.We then obtain an accurate solution to the acoustic Helmholtz equation by solving only a small linear system instead of a large linear system constructed on the fine mesh in conventional methods.We verify our new method using several models of complicated heterogeneities, and the results show that our new multiscale method can solve the Helmholtz equation in complex models with high accuracy and extremely low computational costs.« less

An Efficient Multiscale Finite-Element Method for Frequency-Domain Seismic Wave Propagation

DOE Office of Scientific and Technical Information (OSTI.GOV)

Gao, Kai; Fu, Shubin; Chung, Eric T.

The frequency-domain seismic-wave equation, that is, the Helmholtz equation, has many important applications in seismological studies, yet is very challenging to solve, particularly for large geological models. Iterative solvers, domain decomposition, or parallel strategies can partially alleviate the computational burden, but these approaches may still encounter nontrivial difficulties in complex geological models where a sufficiently fine mesh is required to represent the fine-scale heterogeneities. We develop a novel numerical method to solve the frequency-domain acoustic wave equation on the basis of the multiscale finite-element theory. We discretize a heterogeneous model with a coarse mesh and employ carefully constructed high-order multiscalemore » basis functions to form the basis space for the coarse mesh. Solved from medium- and frequency-dependent local problems, these multiscale basis functions can effectively capture themedium’s fine-scale heterogeneity and the source’s frequency information, leading to a discrete system matrix with a much smaller dimension compared with those from conventional methods.We then obtain an accurate solution to the acoustic Helmholtz equation by solving only a small linear system instead of a large linear system constructed on the fine mesh in conventional methods.We verify our new method using several models of complicated heterogeneities, and the results show that our new multiscale method can solve the Helmholtz equation in complex models with high accuracy and extremely low computational costs.« less

Analytical transition-matrix treatment of electric multipole polarizabilities of hydrogen-like atoms

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kharchenko, V.F., E-mail: vkharchenko@bitp.kiev.ua

2015-04-15

The direct transition-matrix approach to the description of the electric polarization of the quantum bound system of particles is used to determine the electric multipole polarizabilities of the hydrogen-like atoms. It is shown that in the case of the bound system formed by the Coulomb interaction the corresponding inhomogeneous integral equation determining an off-shell scattering function, which consistently describes virtual multiple scattering, can be solved exactly analytically for all electric multipole polarizabilities. Our method allows to reproduce the known Dalgarno–Lewis formula for electric multipole polarizabilities of the hydrogen atom in the ground state and can also be applied to determinemore » the polarizability of the atom in excited bound states. - Highlights: • A new description for electric polarization of hydrogen-like atoms. • Expression for multipole polarizabilities in terms of off-shell scattering functions. • Derivation of integral equation determining the off-shell scattering function. • Rigorous analytic solving the integral equations both for ground and excited states. • Study of contributions of virtual multiple scattering to electric polarizabilities.« less

Computing the Moore-Penrose Inverse of a Matrix with a Computer Algebra System

ERIC Educational Resources Information Center

Schmidt, Karsten

2008-01-01

In this paper "Derive" functions are provided for the computation of the Moore-Penrose inverse of a matrix, as well as for solving systems of linear equations by means of the Moore-Penrose inverse. Making it possible to compute the Moore-Penrose inverse easily with one of the most commonly used Computer Algebra Systems--and to have the blueprint…

Solving Modal Equations of Motion with Initial Conditions Using MSC/NASTRAN DMAP. Part 2; Coupled Versus Uncoupled Integration

NASA Technical Reports Server (NTRS)

Barnett, Alan R.; Ibrahim, Omar M.; Abdallah, Ayman A.; Sullivan, Timothy L.

1993-01-01

By utilizing MSC/NASTRAN DMAP (Direct Matrix Abstraction Program) in an existing NASA Lewis Research Center coupled loads methodology, solving modal equations of motion with initial conditions is possible using either coupled (Newmark-Beta) or uncoupled (exact mode superposition) integration available within module TRD1. Both the coupled and newly developed exact mode superposition methods have been used to perform transient analyses of various space systems. However, experience has shown that in most cases, significant time savings are realized when the equations of motion are integrated using the uncoupled solver instead of the coupled solver. Through the results of a real-world engineering analysis, advantages of using the exact mode superposition methodology are illustrated.

Coupled bending-torsion steady-state response of pretwisted, nonuniform rotating beams using a transfer-matrix method

NASA Technical Reports Server (NTRS)

Gray, Carl E., Jr.

1988-01-01

Using the Newtonian method, the equations of motion are developed for the coupled bending-torsion steady-state response of beams rotating at constant angular velocity in a fixed plane. The resulting equations are valid to first order strain-displacement relationships for a long beam with all other nonlinear terms retained. In addition, the equations are valid for beams with the mass centroidal axis offset (eccentric) from the elastic axis, nonuniform mass and section properties, and variable twist. The solution of these coupled, nonlinear, nonhomogeneous, differential equations is obtained by modifying a Hunter linear second-order transfer-matrix solution procedure to solve the nonlinear differential equations and programming the solution for a desk-top personal computer. The modified transfer-matrix method was verified by comparing the solution for a rotating beam with a geometric, nonlinear, finite-element computer code solution; and for a simple rotating beam problem, the modified method demonstrated a significant advantage over the finite-element solution in accuracy, ease of solution, and actual computer processing time required to effect a solution.

POTHMF: A program for computing potential curves and matrix elements of the coupled adiabatic radial equations for a hydrogen-like atom in a homogeneous magnetic field

NASA Astrophysics Data System (ADS)

Chuluunbaatar, O.; Gusev, A. A.; Gerdt, V. P.; Rostovtsev, V. A.; Vinitsky, S. I.; Abrashkevich, A. G.; Kaschiev, M. S.; Serov, V. V.

2008-02-01

A FORTRAN 77 program is presented which calculates with the relative machine precision potential curves and matrix elements of the coupled adiabatic radial equations for a hydrogen-like atom in a homogeneous magnetic field. The potential curves are eigenvalues corresponding to the angular oblate spheroidal functions that compose adiabatic basis which depends on the radial variable as a parameter. The matrix elements of radial coupling are integrals in angular variables of the following two types: product of angular functions and the first derivative of angular functions in parameter, and product of the first derivatives of angular functions in parameter, respectively. The program calculates also the angular part of the dipole transition matrix elements (in the length form) expressed as integrals in angular variables involving product of a dipole operator and angular functions. Moreover, the program calculates asymptotic regular and irregular matrix solutions of the coupled adiabatic radial equations at the end of interval in radial variable needed for solving a multi-channel scattering problem by the generalized R-matrix method. Potential curves and radial matrix elements computed by the POTHMF program can be used for solving the bound state and multi-channel scattering problems. As a test desk, the program is applied to the calculation of the energy values, a short-range reaction matrix and corresponding wave functions with the help of the KANTBP program. Benchmark calculations for the known photoionization cross-sections are presented. Program summaryProgram title:POTHMF Catalogue identifier:AEAA_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEAA_v1_0.html Program obtainable from:CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions:Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.html No. of lines in distributed program, including test data, etc.:8123 No. of bytes in distributed program, including test data, etc.:131 396 Distribution format:tar.gz Programming language:FORTRAN 77 Computer:Intel Xeon EM64T, Alpha 21264A, AMD Athlon MP, Pentium IV Xeon, Opteron 248, Intel Pentium IV Operating system:OC Linux, Unix AIX 5.3, SunOS 5.8, Solaris, Windows XP RAM:Depends on the number of radial differential equations; the number and order of finite elements; the number of radial points. Test run requires 4 MB Classification:2.5 External routines:POTHMF uses some Lapack routines, copies of which are included in the distribution (see README file for details). Nature of problem:In the multi-channel adiabatic approach the Schrödinger equation for a hydrogen-like atom in a homogeneous magnetic field of strength γ ( γ=B/B, B≅2.35×10 T is a dimensionless parameter which determines the field strength B) is reduced by separating the radial coordinate, r, from the angular variables, (θ,φ), and using a basis of the angular oblate spheroidal functions [3] to a system of second-order ordinary differential equations which contain first-derivative coupling terms [4]. The purpose of this program is to calculate potential curves and matrix elements of radial coupling needed for calculating the low-lying bound and scattering states of hydrogen-like atoms in a homogeneous magnetic field of strength 0<γ⩽1000 within the adiabatic approach [5]. The program evaluates also asymptotic regular and irregular matrix radial solutions of the multi-channel scattering problem needed to extract from the R-matrix a required symmetric shortrange open-channel reaction matrix K [6] independent from matching point [7]. In addition, the program computes the dipole transition matrix elements in the length form between the basis functions that are needed for calculating the dipole transitions between the low-lying bound and scattering states and photoionization cross sections [8]. Solution method:The angular oblate spheroidal eigenvalue problem depending on the radial variable is solved using a series expansion in the Legendre polynomials [3]. The resulting tridiagonal symmetric algebraic eigenvalue problem for the evaluation of selected eigenvalues, i.e. the potential curves, is solved by the LDLT factorization using the DSTEVR program [2]. Derivatives of the eigenfunctions with respect to the radial variable which are contained in matrix elements of the coupled radial equations are obtained by solving the inhomogeneous algebraic equations. The corresponding algebraic problem is solved by using the LDLT factorization with the help of the DPTTRS program [2]. Asymptotics of the matrix elements at large values of radial variable are computed using a series expansion in the associated Laguerre polynomials [9]. The corresponding matching points between the numeric and asymptotic solutions are found automatically. These asymptotics are used for the evaluation of the asymptotic regular and irregular matrix radial solutions of the multi-channel scattering problem [7]. As a test desk, the program is applied to the calculation of the energy values of the ground and excited bound states and reaction matrix of multi-channel scattering problem for a hydrogen atom in a homogeneous magnetic field using the KANTBP program [10]. Restrictions:The computer memory requirements depend on: the number of radial differential equations; the number and order of finite elements; the total number of radial points. Restrictions due to dimension sizes can be changed by resetting a small number of PARAMETER statements before recompiling (see Introduction and listing for details). Running time:The running time depends critically upon: the number of radial differential equations; the number and order of finite elements; the total number of radial points on interval [r,r]. The test run which accompanies this paper took 7 s required for calculating of potential curves, radial matrix elements, and dipole transition matrix elements on a finite-element grid on interval [ r=0, r=100] used for solving discrete and continuous spectrum problems and obtaining asymptotic regular and irregular matrix radial solutions at r=100 for continuous spectrum problem on the Intel Pentium IV 2.4 GHz. The number of radial differential equations was equal to 6. The accompanying test run using the KANTBP program took 2 s for solving discrete and continuous spectrum problems using the above calculated potential curves, matrix elements and asymptotic regular and irregular matrix radial solutions. Note, that in the accompanied benchmark calculations of the photoionization cross-sections from the bound states of a hydrogen atom in a homogeneous magnetic field to continuum we have used interval [ r=0, r=1000] for continuous spectrum problem. The total number of radial differential equations was varied from 10 to 18. References:W.H. Press, S.A. Teukolsky, W.T. Vetterling, B.P. Flannery, Numerical Recipes: The Art of Scientific Computing, Cambridge University Press, Cambridge, 1986. http://www.netlib.org/lapack/. M. Abramovits, I.A. Stegun, Handbook of Mathematical Functions, Dover, New York, 1965. U. Fano, Colloq. Int. C.N.R.S. 273 (1977) 127; A.F. Starace, G.L. Webster, Phys. Rev. A 19 (1979) 1629-1640; C.V. Clark, K.T. Lu, A.F. Starace, in: H.G. Beyer, H. Kleinpoppen (Eds.), Progress in Atomic Spectroscopy, Part C, Plenum, New York, 1984, pp. 247-320; U. Fano, A.R.P. Rau, Atomic Collisions and Spectra, Academic Press, Florida, 1986. M.G. Dimova, M.S. Kaschiev, S.I. Vinitsky, J. Phys. B 38 (2005) 2337-2352; O. Chuluunbaatar, A.A. Gusev, V.L. Derbov, M.S. Kaschiev, V.V. Serov, T.V. Tupikova, S.I. Vinitsky, Proc. SPIE 6537 (2007) 653706-1-18. M.J. Seaton, Rep. Prog. Phys. 46 (1983) 167-257. M. Gailitis, J. Phys. B 9 (1976) 843-854; J. Macek, Phys. Rev. A 30 (1984) 1277-1278; S.I. Vinitsky, V.P. Gerdt, A.A. Gusev, M.S. Kaschiev, V.A. Rostovtsev, V.N. Samoylov, T.V. Tupikova, O. Chuluunbaatar, Programming and Computer Software 33 (2007) 105-116. H. Friedrich, Theoretical Atomic Physics, Springer, New York, 1991. R.J. Damburg, R.Kh. Propin, J. Phys. B 1 (1968) 681-691; J.D. Power, Phil. Trans. Roy. Soc. London A 274 (1973) 663-702. O. Chuluunbaatar, A.A. Gusev, A.G. Abrashkevich, A. Amaya-Tapia, M.S. Kaschiev, S.Y. Larsen, S.I. Vinitsky, Comput. Phys. Comm. 177 (2007) 649-675.

Accelerating wave propagation modeling in the frequency domain using Python

NASA Astrophysics Data System (ADS)

Jo, Sang Hoon; Park, Min Jun; Ha, Wan Soo

2017-04-01

Python is a dynamic programming language adopted in many science and engineering areas. We used Python to simulate wave propagation in the frequency domain. We used the Pardiso matrix solver to solve the impedance matrix of the wave equation. Numerical examples shows that Python with numpy consumes longer time to construct the impedance matrix using the finite element method when compared with Fortran; however we could reduce the time significantly to be comparable to that of Fortran using a simple Numba decorator.

Time-dependent quantum transport: An efficient method based on Liouville-von-Neumann equation for single-electron density matrix

NASA Astrophysics Data System (ADS)

Xie, Hang; Jiang, Feng; Tian, Heng; Zheng, Xiao; Kwok, Yanho; Chen, Shuguang; Yam, ChiYung; Yan, YiJing; Chen, Guanhua

2012-07-01

Basing on our hierarchical equations of motion for time-dependent quantum transport [X. Zheng, G. H. Chen, Y. Mo, S. K. Koo, H. Tian, C. Y. Yam, and Y. J. Yan, J. Chem. Phys. 133, 114101 (2010), 10.1063/1.3475566], we develop an efficient and accurate numerical algorithm to solve the Liouville-von-Neumann equation. We solve the real-time evolution of the reduced single-electron density matrix at the tight-binding level. Calculations are carried out to simulate the transient current through a linear chain of atoms, with each represented by a single orbital. The self-energy matrix is expanded in terms of multiple Lorentzian functions, and the Fermi distribution function is evaluated via the Padè spectrum decomposition. This Lorentzian-Padè decomposition scheme is employed to simulate the transient current. With sufficient Lorentzian functions used to fit the self-energy matrices, we show that the lead spectral function and the dynamics response can be treated accurately. Compared to the conventional master equation approaches, our method is much more efficient as the computational time scales cubically with the system size and linearly with the simulation time. As a result, the simulations of the transient currents through systems containing up to one hundred of atoms have been carried out. As density functional theory is also an effective one-particle theory, the Lorentzian-Padè decomposition scheme developed here can be generalized for first-principles simulation of realistic systems.

Stabilisation of time-varying linear systems via Lyapunov differential equations

NASA Astrophysics Data System (ADS)

Zhou, Bin; Cai, Guang-Bin; Duan, Guang-Ren

2013-02-01

This article studies stabilisation problem for time-varying linear systems via state feedback. Two types of controllers are designed by utilising solutions to Lyapunov differential equations. The first type of feedback controllers involves the unique positive-definite solution to a parametric Lyapunov differential equation, which can be solved when either the state transition matrix of the open-loop system is exactly known, or the future information of the system matrices are accessible in advance. Different from the first class of controllers which may be difficult to implement in practice, the second type of controllers can be easily implemented by solving a state-dependent Lyapunov differential equation with a given positive-definite initial condition. In both cases, explicit conditions are obtained to guarantee the exponentially asymptotic stability of the associated closed-loop systems. Numerical examples show the effectiveness of the proposed approaches.

Solution algorithms for nonlinear transient heat conduction analysis employing element-by-element iterative strategies

NASA Technical Reports Server (NTRS)

Winget, J. M.; Hughes, T. J. R.

1985-01-01

The particular problems investigated in the present study arise from nonlinear transient heat conduction. One of two types of nonlinearities considered is related to a material temperature dependence which is frequently needed to accurately model behavior over the range of temperature of engineering interest. The second nonlinearity is introduced by radiation boundary conditions. The finite element equations arising from the solution of nonlinear transient heat conduction problems are formulated. The finite element matrix equations are temporally discretized, and a nonlinear iterative solution algorithm is proposed. Algorithms for solving the linear problem are discussed, taking into account the form of the matrix equations, Gaussian elimination, cost, and iterative techniques. Attention is also given to approximate factorization, implementational aspects, and numerical results.

Theoretical investigation of the force and dynamically coupled torsional-axial-lateral dynamic response of eared rotors

NASA Technical Reports Server (NTRS)

David, J. W.; Mitchell, L. D.

1982-01-01

Difficulties in solution methodology to be used to deal with the potentially higher nonlinear rotor equations when dynamic coupling is included. A solution methodology is selected to solve the nonlinear differential equations. The selected method was verified to give good results even at large nonlinearity levels. The transfer matrix methodology is extended to the solution of nonlinear problems.

An efficient numerical technique for calculating thermal spreading resistance

NASA Technical Reports Server (NTRS)

Gale, E. H., Jr.

1977-01-01

An efficient numerical technique for solving the equations resulting from finite difference analyses of fields governed by Poisson's equation is presented. The method is direct (noniterative)and the computer work required varies with the square of the order of the coefficient matrix. The computational work required varies with the cube of this order for standard inversion techniques, e.g., Gaussian elimination, Jordan, Doolittle, etc.

A System of Poisson Equations for a Nonconstant Varadhan Functional on a Finite State Space

DOE Office of Scientific and Technical Information (OSTI.GOV)

Cavazos-Cadena, Rolando; Hernandez-Hernandez, Daniel

2006-01-15

Given a discrete-time Markov chain with finite state space and a stationary transition matrix, a system of 'local' Poisson equations characterizing the (exponential) Varadhan's functional J(.) is given. The main results, which are derived for an arbitrary transition structure so that J(.) may be nonconstant, are as follows: (i) Any solution to the local Poisson equations immediately renders Varadhan's functional, and (ii) a solution of the system always exist. The proof of this latter result is constructive and suggests a method to solve the local Poisson equations.

On the effective implementation of a boundary element code on graphics processing units unsing an out-of-core LU algorithm

DOE Office of Scientific and Technical Information (OSTI.GOV)

D'Azevedo, Ed F; Nintcheu Fata, Sylvain

2012-01-01

A collocation boundary element code for solving the three-dimensional Laplace equation, publicly available from \\url{http://www.intetec.org}, has been adapted to run on an Nvidia Tesla general purpose graphics processing unit (GPU). Global matrix assembly and LU factorization of the resulting dense matrix were performed on the GPU. Out-of-core techniques were used to solve problems larger than available GPU memory. The code achieved over eight times speedup in matrix assembly and about 56~Gflops/sec in the LU factorization using only 512~Mbytes of GPU memory. Details of the GPU implementation and comparisons with the standard sequential algorithm are included to illustrate the performance ofmore » the GPU code.« less

A Higher Harmonic Optimal Controller to Optimise Rotorcraft Aeromechanical Behaviour

NASA Technical Reports Server (NTRS)

Leyland, Jane Anne

1996-01-01

Three methods to optimize rotorcraft aeromechanical behavior for those cases where the rotorcraft plant can be adequately represented by a linear model system matrix were identified and implemented in a stand-alone code. These methods determine the optimal control vector which minimizes the vibration metric subject to constraints at discrete time points, and differ from the commonly used non-optimal constraint penalty methods such as those employed by conventional controllers in that the constraints are handled as actual constraints to an optimization problem rather than as just additional terms in the performance index. The first method is to use a Non-linear Programming algorithm to solve the problem directly. The second method is to solve the full set of non-linear equations which define the necessary conditions for optimality. The third method is to solve each of the possible reduced sets of equations defining the necessary conditions for optimality when the constraints are pre-selected to be either active or inactive, and then to simply select the best solution. The effects of maneuvers and aeroelasticity on the systems matrix are modelled by using a pseudo-random pseudo-row-dependency scheme to define the systems matrix. Cases run to date indicate that the first method of solution is reliable, robust, and easiest to use, and that it was superior to the conventional controllers which were considered.

Hybrid state vector methods for structural dynamic and aeroelastic boundary value problems

NASA Technical Reports Server (NTRS)

Lehman, L. L.

1982-01-01

A computational technique is developed that is suitable for performing preliminary design aeroelastic and structural dynamic analyses of large aspect ratio lifting surfaces. The method proves to be quite general and can be adapted to solving various two point boundary value problems. The solution method, which is applicable to both fixed and rotating wing configurations, is based upon a formulation of the structural equilibrium equations in terms of a hybrid state vector containing generalized force and displacement variables. A mixed variational formulation is presented that conveniently yields a useful form for these state vector differential equations. Solutions to these equations are obtained by employing an integrating matrix method. The application of an integrating matrix provides a discretization of the differential equations that only requires solutions of standard linear matrix systems. It is demonstrated that matrix partitioning can be used to reduce the order of the required solutions. Results are presented for several example problems in structural dynamics and aeroelasticity to verify the technique and to demonstrate its use. These problems examine various types of loading and boundary conditions and include aeroelastic analyses of lifting surfaces constructed from anisotropic composite materials.

A momentum-space formulation without partial wave decomposition for scattering of two spin-half particles

DOE Office of Scientific and Technical Information (OSTI.GOV)

Fachruddin, Imam, E-mail: imam.fachruddin@sci.ui.ac.id; Salam, Agus

2016-03-11

A new momentum-space formulation for scattering of two spin-half particles, both either identical or unidentical, is formulated. As basis states the free linear-momentum states are not expanded into the angular-momentum states, the system’s spin states are described by the product of the spin states of the two particles, and the system’s isospin states by the total isospin states of the two particles. We evaluate the Lippmann-Schwinger equations for the T-matrix elements in these basis states. The azimuthal behavior of the potential and of the T-matrix elements leads to a set of coupled integral equations for the T-matrix elements in twomore » variables only, which are the magnitude of the relative momentum and the scattering angle. Some symmetry relations for the potential and the T-matrix elements reduce the number of the integral equations to be solved. A set of six spin operators to express any interaction of two spin-half particles is introduced. We show the spin-averaged differential cross section as being calculated in terms of the solution of the set of the integral equations.« less

Projective-Dual Method for Solving Systems of Linear Equations with Nonnegative Variables

NASA Astrophysics Data System (ADS)

Ganin, B. V.; Golikov, A. I.; Evtushenko, Yu. G.

2018-02-01

In order to solve an underdetermined system of linear equations with nonnegative variables, the projection of a given point onto its solutions set is sought. The dual of this problem—the problem of unconstrained maximization of a piecewise-quadratic function—is solved by Newton's method. The problem of unconstrained optimization dual of the regularized problem of finding the projection onto the solution set of the system is considered. A connection of duality theory and Newton's method with some known algorithms of projecting onto a standard simplex is shown. On the example of taking into account the specifics of the constraints of the transport linear programming problem, the possibility to increase the efficiency of calculating the generalized Hessian matrix is demonstrated. Some examples of numerical calculations using MATLAB are presented.

Effect of interfacial stresses in an elastic body with a nanoinclusion

NASA Astrophysics Data System (ADS)

Vakaeva, Aleksandra B.; Grekov, Mikhail A.

2018-05-01

The 2-D problem of an infinite elastic solid with a nanoinclusion of a different from circular shape is solved. The interfacial stresses are acting at the interface. Contact of the inclusion with the matrix satisfies the ideal conditions of cohesion. The generalized Laplace - Young law defines conditions at the interface. To solve the problem, Gurtin - Murdoch surface elasticity model, Goursat - Kolosov complex potentials and the boundary perturbation method are used. The problem is reduced to the solution of two independent Riemann - Hilbert's boundary problems. For the circular inclusion, hypersingular integral equation in an unknown interfacial stress is derived. The algorithm of solving this equation is constructed. The influence of the interfacial stress and the dimension of the circular inclusion on the stress distribution and stress concentration at the interface are analyzed.

Computing wave functions in multichannel collisions with non-local potentials using the R-matrix method

NASA Astrophysics Data System (ADS)

Bonitati, Joey; Slimmer, Ben; Li, Weichuan; Potel, Gregory; Nunes, Filomena

2017-09-01

The calculable form of the R-matrix method has been previously shown to be a useful tool in approximately solving the Schrodinger equation in nuclear scattering problems. We use this technique combined with the Gauss quadrature for the Lagrange-mesh method to efficiently solve for the wave functions of projectile nuclei in low energy collisions (1-100 MeV) involving an arbitrary number of channels. We include the local Woods-Saxon potential, the non-local potential of Perey and Buck, a Coulomb potential, and a coupling potential to computationally solve for the wave function of two nuclei at short distances. Object oriented programming is used to increase modularity, and parallel programming techniques are introduced to reduce computation time. We conclude that the R-matrix method is an effective method to predict the wave functions of nuclei in scattering problems involving both multiple channels and non-local potentials. Michigan State University iCER ACRES REU.

The Split Coefficient Matrix method for hyperbolic systems of gasdynamic equations

NASA Technical Reports Server (NTRS)

Chakravarthy, S. R.; Anderson, D. A.; Salas, M. D.

1980-01-01

The Split Coefficient Matrix (SCM) finite difference method for solving hyperbolic systems of equations is presented. This new method is based on the mathematical theory of characteristics. The development of the method from characteristic theory is presented. Boundary point calculation procedures consistent with the SCM method used at interior points are explained. The split coefficient matrices that define the method for steady supersonic and unsteady inviscid flows are given for several examples. The SCM method is used to compute several flow fields to demonstrate its accuracy and versatility. The similarities and differences between the SCM method and the lambda-scheme are discussed.

Aztec user`s guide. Version 1

DOE Office of Scientific and Technical Information (OSTI.GOV)

Hutchinson, S.A.; Shadid, J.N.; Tuminaro, R.S.

1995-10-01

Aztec is an iterative library that greatly simplifies the parallelization process when solving the linear systems of equations Ax = b where A is a user supplied n x n sparse matrix, b is a user supplied vector of length n and x is a vector of length n to be computed. Aztec is intended as a software tool for users who want to avoid cumbersome parallel programming details but who have large sparse linear systems which require an efficiently utilized parallel processing system. A collection of data transformation tools are provided that allow for easy creation of distributed sparsemore » unstructured matrices for parallel solution. Once the distributed matrix is created, computation can be performed on any of the parallel machines running Aztec: nCUBE 2, IBM SP2 and Intel Paragon, MPI platforms as well as standard serial and vector platforms. Aztec includes a number of Krylov iterative methods such as conjugate gradient (CG), generalized minimum residual (GMRES) and stabilized biconjugate gradient (BICGSTAB) to solve systems of equations. These Krylov methods are used in conjunction with various preconditioners such as polynomial or domain decomposition methods using LU or incomplete LU factorizations within subdomains. Although the matrix A can be general, the package has been designed for matrices arising from the approximation of partial differential equations (PDEs). In particular, the Aztec package is oriented toward systems arising from PDE applications.« less

A fast semi-discrete Kansa method to solve the two-dimensional spatiotemporal fractional diffusion equation

NASA Astrophysics Data System (ADS)

Sun, HongGuang; Liu, Xiaoting; Zhang, Yong; Pang, Guofei; Garrard, Rhiannon

2017-09-01

Fractional-order diffusion equations (FDEs) extend classical diffusion equations by quantifying anomalous diffusion frequently observed in heterogeneous media. Real-world diffusion can be multi-dimensional, requiring efficient numerical solvers that can handle long-term memory embedded in mass transport. To address this challenge, a semi-discrete Kansa method is developed to approximate the two-dimensional spatiotemporal FDE, where the Kansa approach first discretizes the FDE, then the Gauss-Jacobi quadrature rule solves the corresponding matrix, and finally the Mittag-Leffler function provides an analytical solution for the resultant time-fractional ordinary differential equation. Numerical experiments are then conducted to check how the accuracy and convergence rate of the numerical solution are affected by the distribution mode and number of spatial discretization nodes. Applications further show that the numerical method can efficiently solve two-dimensional spatiotemporal FDE models with either a continuous or discrete mixing measure. Hence this study provides an efficient and fast computational method for modeling super-diffusive, sub-diffusive, and mixed diffusive processes in large, two-dimensional domains with irregular shapes.

Methodology for sensitivity analysis, approximate analysis, and design optimization in CFD for multidisciplinary applications

NASA Technical Reports Server (NTRS)

Taylor, Arthur C., III; Hou, Gene W.

1993-01-01

In this study involving advanced fluid flow codes, an incremental iterative formulation (also known as the delta or correction form) together with the well-known spatially-split approximate factorization algorithm, is presented for solving the very large sparse systems of linear equations which are associated with aerodynamic sensitivity analysis. For smaller 2D problems, a direct method can be applied to solve these linear equations in either the standard or the incremental form, in which case the two are equivalent. Iterative methods are needed for larger 2D and future 3D applications, however, because direct methods require much more computer memory than is currently available. Iterative methods for solving these equations in the standard form are generally unsatisfactory due to an ill-conditioning of the coefficient matrix; this problem can be overcome when these equations are cast in the incremental form. These and other benefits are discussed. The methodology is successfully implemented and tested in 2D using an upwind, cell-centered, finite volume formulation applied to the thin-layer Navier-Stokes equations. Results are presented for two sample airfoil problems: (1) subsonic low Reynolds number laminar flow; and (2) transonic high Reynolds number turbulent flow.

Examination of the Chayes-Kruskal procedure for testing correlations between proportions

USGS Publications Warehouse

Kork, J.O.

1977-01-01

The Chayes-Kruskal procedure for testing correlations between proportions uses a linear approximation to the actual closure transformation to provide a null value, pij, against which an observed closed correlation coefficient, rij, can be tested. It has been suggested that a significant difference between pij and rij would indicate a nonzero covariance relationship between the ith and jth open variables. In this paper, the linear approximation to the closure transformation is described in terms of a matrix equation. Examination of the solution set of this equation shows that estimation of, or even the identification of, significant nonzero open correlations is essentially impossible even if the number of variables and the sample size are large. The method of solving the matrix equation is described in the appendix. ?? 1977 Plenum Publishing Corporation.

Optical systolic solutions of linear algebraic equations

NASA Technical Reports Server (NTRS)

Neuman, C. P.; Casasent, D.

1984-01-01

The philosophy and data encoding possible in systolic array optical processor (SAOP) were reviewed. The multitude of linear algebraic operations achievable on this architecture is examined. These operations include such linear algebraic algorithms as: matrix-decomposition, direct and indirect solutions, implicit and explicit methods for partial differential equations, eigenvalue and eigenvector calculations, and singular value decomposition. This architecture can be utilized to realize general techniques for solving matrix linear and nonlinear algebraic equations, least mean square error solutions, FIR filters, and nested-loop algorithms for control engineering applications. The data flow and pipelining of operations, design of parallel algorithms and flexible architectures, application of these architectures to computationally intensive physical problems, error source modeling of optical processors, and matching of the computational needs of practical engineering problems to the capabilities of optical processors are emphasized.

Multichannel myopic deconvolution in underwater acoustic channels via low-rank recovery

PubMed Central

Tian, Ning; Byun, Sung-Hoon; Sabra, Karim; Romberg, Justin

2017-01-01

This paper presents a technique for solving the multichannel blind deconvolution problem. The authors observe the convolution of a single (unknown) source with K different (unknown) channel responses; from these channel outputs, the authors want to estimate both the source and the channel responses. The authors show how this classical signal processing problem can be viewed as solving a system of bilinear equations, and in turn can be recast as recovering a rank-1 matrix from a set of linear observations. Results of prior studies in the area of low-rank matrix recovery have identified effective convex relaxations for problems of this type and efficient, scalable heuristic solvers that enable these techniques to work with thousands of unknown variables. The authors show how a priori information about the channels can be used to build a linear model for the channels, which in turn makes solving these systems of equations well-posed. This study demonstrates the robustness of this methodology to measurement noises and parametrization errors of the channel impulse responses with several stylized and shallow water acoustic channel simulations. The performance of this methodology is also verified experimentally using shipping noise recorded on short bottom-mounted vertical line arrays. PMID:28599565

Applying transfer matrix method to the estimation of the modal characteristics of the NASA Mini-Mass Truss

NASA Technical Reports Server (NTRS)

Shen, Ji-Yao; Taylor, Lawrence W., Jr.

1994-01-01

It is beneficial to use a distributed parameter model for large space structures because the approach minimizes the number of model parameters. Holzer's transfer matrix method provides a useful means to simplify and standardize the procedure for solving the system of partial differential equations. Any large space structures can be broken down into sub-structures with simple elastic and dynamical properties. For each single element, such as beam, tether, or rigid body, we can derive the corresponding transfer matrix. Combining these elements' matrices enables the solution of the global system equations. The characteristics equation can then be formed by satisfying the appropriate boundary conditions. Then natural frequencies and mode shapes can be determined by searching the roots of the characteristic equation at frequencies within the range of interest. This paper applies this methodology, and the maximum likelihood estimation method, to refine the modal characteristics of the NASA Mini-Mast Truss by successively matching the theoretical response to the test data of the truss. The method is being applied to more complex configurations.

Algorithms and software for solving finite element equations on serial and parallel architectures

NASA Technical Reports Server (NTRS)

Chu, Eleanor; George, Alan

1988-01-01

The primary objective was to compare the performance of state-of-the-art techniques for solving sparse systems with those that are currently available in the Computational Structural Mechanics (MSC) testbed. One of the first tasks was to become familiar with the structure of the testbed, and to install some or all of the SPARSPAK package in the testbed. A brief overview of the CSM Testbed software and its usage is presented. An overview of the sparse matrix research for the Testbed currently employed in the CSM Testbed is given. An interface which was designed and implemented as a research tool for installing and appraising new matrix processors in the CSM Testbed is described. The results of numerical experiments performed in solving a set of testbed demonstration problems using the processor SPK and other experimental processors are contained.

Modeling creep behavior of fiber composites

NASA Technical Reports Server (NTRS)

Chen, J. L.; Sun, C. T.

1988-01-01

A micromechanical model for the creep behavior of fiber composites is developed based on a typical cell consisting of a fiber and the surrounding matrix. The fiber is assumed to be linearly elastic and the matrix nonlinearly viscous. The creep strain rate in the matrix is assumed to be a function of stress. The nominal stress-strain relations are derived in the form of differential equations which are solved numerically for off-axis specimens under uniaxial loading. A potential function and the associated effective stress and effective creep strain rates are introduced to simplify the orthotropic relations.

Sharing Teaching Ideas.

ERIC Educational Resources Information Center

Mathematics Teacher, 1985

1985-01-01

Discusses: (1) use of matrix techniques to write secret codes (includes ready-to-duplicate worksheets); (2) a method of multiplication and division of polynomials in one variable that is not tedius, time-consuming, or dependent on guesswork; and (3) adding and subtracting rational expressions and solving rational equations. (JN)

COMPUTATION OF GLOBAL PHOTOCHEMISTRY WITH SMVGEAR II (R823186)

EPA Science Inventory

A computer model was developed to simulate global gas-phase photochemistry. The model solves chemical equations with SMVGEAR II, a sparse-matrix, vectorized Gear-type code. To obtain SMVGEAR II, the original SMVGEAR code was modified to allow computation of different sets of chem...

LIKELIHOOD RATIO TESTS OF HYPOTHESES ON MULTIVARIATE POPULATIONS, VOLUME II, TEST OF HYPOTHESIS--STATISTICAL MODELS FOR THE EVALUATION AND INTERPRETATION OF EDUCATIONAL CRITERIA. PART 4.

ERIC Educational Resources Information Center

SAW, J.G.

THIS PAPER DEALS WITH SOME TESTS OF HYPOTHESIS FREQUENTLY ENCOUNTERED IN THE ANALYSIS OF MULTIVARIATE DATA. THE TYPE OF HYPOTHESIS CONSIDERED IS THAT WHICH THE STATISTICIAN CAN ANSWER IN THE NEGATIVE OR AFFIRMATIVE. THE DOOLITTLE METHOD MAKES IT POSSIBLE TO EVALUATE THE DETERMINANT OF A MATRIX OF HIGH ORDER, TO SOLVE A MATRIX EQUATION, OR TO…

Global asymptotic stabilisation of rational dynamical systems based on solving BMI

NASA Astrophysics Data System (ADS)

Esmaili, Farhad; Kamyad, A. V.; Jahed-Motlagh, Mohammad Reza; Pariz, Naser

2017-08-01

In this paper, the global asymptotic stabiliser design of rational systems is studied in detail. To develop the idea, the state equations of the system are transformed to a new coordinate via polynomial transformation and the state feedback control law. This in turn is followed by the satisfaction of the linear growth condition (i.e. Lipschitz at zero). Based on a linear matrix inequality solution, the system in the new coordinate is globally asymptotically stabilised and then, leading to the global asymptotic stabilisation of the primary system. The polynomial transformation coefficients are derived by solving the bilinear matrix inequality problem. To confirm the capability of this method, three examples are highlighted.

A new fast direct solver for the boundary element method

NASA Astrophysics Data System (ADS)

Huang, S.; Liu, Y. J.

2017-09-01

A new fast direct linear equation solver for the boundary element method (BEM) is presented in this paper. The idea of the new fast direct solver stems from the concept of the hierarchical off-diagonal low-rank matrix. The hierarchical off-diagonal low-rank matrix can be decomposed into the multiplication of several diagonal block matrices. The inverse of the hierarchical off-diagonal low-rank matrix can be calculated efficiently with the Sherman-Morrison-Woodbury formula. In this paper, a more general and efficient approach to approximate the coefficient matrix of the BEM with the hierarchical off-diagonal low-rank matrix is proposed. Compared to the current fast direct solver based on the hierarchical off-diagonal low-rank matrix, the proposed method is suitable for solving general 3-D boundary element models. Several numerical examples of 3-D potential problems with the total number of unknowns up to above 200,000 are presented. The results show that the new fast direct solver can be applied to solve large 3-D BEM models accurately and with better efficiency compared with the conventional BEM.

Modeling the missile-launch tube problem in DYSCO

NASA Technical Reports Server (NTRS)

Berman, Alex; Gustavson, Bruce A.

1989-01-01

DYSCO is a versatile, general purpose dynamic analysis program which assembles equations and solves dynamics problems. The executive manages a library of technology modules which contain routines that compute the matrix coefficients of the second order ordinary differential equations of the components. The executive performs the coupling of the equations of the components and manages the solution of the coupled equations. Any new component representation may be added to the library if, given the state vector, a FORTRAN program can be written to compute M, C, K, and F. The problem described demonstrates the generality of this statement.

Discretization of the induced-charge boundary integral equation.

PubMed

Bardhan, Jaydeep P; Eisenberg, Robert S; Gillespie, Dirk

2009-07-01

Boundary-element methods (BEMs) for solving integral equations numerically have been used in many fields to compute the induced charges at dielectric boundaries. In this paper, we consider a more accurate implementation of BEM in the context of ions in aqueous solution near proteins, but our results are applicable more generally. The ions that modulate protein function are often within a few angstroms of the protein, which leads to the significant accumulation of polarization charge at the protein-solvent interface. Computing the induced charge accurately and quickly poses a numerical challenge in solving a popular integral equation using BEM. In particular, the accuracy of simulations can depend strongly on seemingly minor details of how the entries of the BEM matrix are calculated. We demonstrate that when the dielectric interface is discretized into flat tiles, the qualocation method of Tausch [IEEE Trans Comput.-Comput.-Aided Des. 20, 1398 (2001)] to compute the BEM matrix elements is always more accurate than the traditional centroid-collocation method. Qualocation is not more expensive to implement than collocation and can save significant computational time by reducing the number of boundary elements needed to discretize the dielectric interfaces.

Discretization of the induced-charge boundary integral equation

NASA Astrophysics Data System (ADS)

Bardhan, Jaydeep P.; Eisenberg, Robert S.; Gillespie, Dirk

2009-07-01

Boundary-element methods (BEMs) for solving integral equations numerically have been used in many fields to compute the induced charges at dielectric boundaries. In this paper, we consider a more accurate implementation of BEM in the context of ions in aqueous solution near proteins, but our results are applicable more generally. The ions that modulate protein function are often within a few angstroms of the protein, which leads to the significant accumulation of polarization charge at the protein-solvent interface. Computing the induced charge accurately and quickly poses a numerical challenge in solving a popular integral equation using BEM. In particular, the accuracy of simulations can depend strongly on seemingly minor details of how the entries of the BEM matrix are calculated. We demonstrate that when the dielectric interface is discretized into flat tiles, the qualocation method of Tausch [IEEE Trans Comput.-Comput.-Aided Des. 20, 1398 (2001)] to compute the BEM matrix elements is always more accurate than the traditional centroid-collocation method. Qualocation is not more expensive to implement than collocation and can save significant computational time by reducing the number of boundary elements needed to discretize the dielectric interfaces.

Stable Numerical Approach for Fractional Delay Differential Equations

NASA Astrophysics Data System (ADS)

Singh, Harendra; Pandey, Rajesh K.; Baleanu, D.

2017-12-01

In this paper, we present a new stable numerical approach based on the operational matrix of integration of Jacobi polynomials for solving fractional delay differential equations (FDDEs). The operational matrix approach converts the FDDE into a system of linear equations, and hence the numerical solution is obtained by solving the linear system. The error analysis of the proposed method is also established. Further, a comparative study of the approximate solutions is provided for the test examples of the FDDE by varying the values of the parameters in the Jacobi polynomials. As in special case, the Jacobi polynomials reduce to the well-known polynomials such as (1) Legendre polynomial, (2) Chebyshev polynomial of second kind, (3) Chebyshev polynomial of third and (4) Chebyshev polynomial of fourth kind respectively. Maximum absolute error and root mean square error are calculated for the illustrated examples and presented in form of tables for the comparison purpose. Numerical stability of the presented method with respect to all four kind of polynomials are discussed. Further, the obtained numerical results are compared with some known methods from the literature and it is observed that obtained results from the proposed method is better than these methods.

An efficient implementation of a high-order filter for a cubed-sphere spectral element model

NASA Astrophysics Data System (ADS)

Kang, Hyun-Gyu; Cheong, Hyeong-Bin

2017-03-01

A parallel-scalable, isotropic, scale-selective spatial filter was developed for the cubed-sphere spectral element model on the sphere. The filter equation is a high-order elliptic (Helmholtz) equation based on the spherical Laplacian operator, which is transformed into cubed-sphere local coordinates. The Laplacian operator is discretized on the computational domain, i.e., on each cell, by the spectral element method with Gauss-Lobatto Lagrange interpolating polynomials (GLLIPs) as the orthogonal basis functions. On the global domain, the discrete filter equation yielded a linear system represented by a highly sparse matrix. The density of this matrix increases quadratically (linearly) with the order of GLLIP (order of the filter), and the linear system is solved in only O (Ng) operations, where Ng is the total number of grid points. The solution, obtained by a row reduction method, demonstrated the typical accuracy and convergence rate of the cubed-sphere spectral element method. To achieve computational efficiency on parallel computers, the linear system was treated by an inverse matrix method (a sparse matrix-vector multiplication). The density of the inverse matrix was lowered to only a few times of the original sparse matrix without degrading the accuracy of the solution. For better computational efficiency, a local-domain high-order filter was introduced: The filter equation is applied to multiple cells, and then the central cell was only used to reconstruct the filtered field. The parallel efficiency of applying the inverse matrix method to the global- and local-domain filter was evaluated by the scalability on a distributed-memory parallel computer. The scale-selective performance of the filter was demonstrated on Earth topography. The usefulness of the filter as a hyper-viscosity for the vorticity equation was also demonstrated.

An efficient algorithm using matrix methods to solve wind tunnel force-balance equations

NASA Technical Reports Server (NTRS)

Smith, D. L.

1972-01-01

An iterative procedure applying matrix methods to accomplish an efficient algorithm for automatic computer reduction of wind-tunnel force-balance data has been developed. Balance equations are expressed in a matrix form that is convenient for storing balance sensitivities and interaction coefficient values for online or offline batch data reduction. The convergence of the iterative values to a unique solution of this system of equations is investigated, and it is shown that for balances which satisfy the criteria discussed, this type of solution does occur. Methods for making sensitivity adjustments and initial load effect considerations in wind-tunnel applications are also discussed, and the logic for determining the convergence accuracy limits for the iterative solution is given. This more efficient data reduction program is compared with the technique presently in use at the NASA Langley Research Center, and computational times on the order of one-third or less are demonstrated by use of this new program.

A Novel Approach to Solve Linearized Stellar Pulsation Equations

NASA Astrophysics Data System (ADS)

Bard, Christopher; Teitler, S.

2011-01-01

We present a new approach to modeling linearized, non-radial pulsations in differentially rotating, massive stars. As a first step in this direction, we consider adiabatic pulsations and adopt the Cowling approximation that perturbations of the gravitational potential and its radial derivative are negligible. The angular dependence of the pulsation modes is expressed as a series expansion of associated Legendre polynomials; the resulting coupled system of differential equations is then solved by finding the eigenfrequencies at which the determinant of a characteristic matrix vanishes. Our method improves on previous treatments by removing the requirement that an arbitrary normalization be applied to the eigenfunctions; this brings the benefit of improved numerical robustness.

An efficient finite element technique for sound propagation in axisymmetric hard wall ducts carrying high subsonic Mach number flows

NASA Technical Reports Server (NTRS)

Tag, I. A.; Lumsdaine, E.

1978-01-01

The general non-linear three-dimensional equation for acoustic potential is derived by using a perturbation technique. The linearized axisymmetric equation is then solved by using a finite element algorithm based on the Galerkin formulation for a harmonic time dependence. The solution is carried out in complex number notation for the acoustic velocity potential. Linear, isoparametric, quadrilateral elements with non-uniform distribution across the duct section are implemented. The resultant global matrix is stored in banded form and solved by using a modified Gauss elimination technique. Sound pressure levels and acoustic velocities are calculated from post element solutions. Different duct geometries are analyzed and compared with experimental results.

Generalized thermoelastic interaction in an isotropic solid cylinder without energy dissipation

NASA Astrophysics Data System (ADS)

Alshaikh, Fatimah

2018-04-01

In this paper, we constructed the generalized thermoelastic equations of an isotropic solid cylinder. The formulation is applied in the context of Green and Naghdi theory of types II (without energy dissipation). The material of the cylinder is supposed to be homogeneous isotropic both mechanically and thermally. The governing equations have been written in the form of a vector-matrix differential equation in the Laplace transform domain, which is then solved by an eigenvalue approach. Numerical results for the temperature distribution, displacement and radial stress are represented graphically.

Finite Differences and Collocation Methods for the Solution of the Two Dimensional Heat Equation

NASA Technical Reports Server (NTRS)

Kouatchou, Jules

1999-01-01

In this paper we combine finite difference approximations (for spatial derivatives) and collocation techniques (for the time component) to numerically solve the two dimensional heat equation. We employ respectively a second-order and a fourth-order schemes for the spatial derivatives and the discretization method gives rise to a linear system of equations. We show that the matrix of the system is non-singular. Numerical experiments carried out on serial computers, show the unconditional stability of the proposed method and the high accuracy achieved by the fourth-order scheme.

Linear quadratic regulators with eigenvalue placement in a horizontal strip

NASA Technical Reports Server (NTRS)

Shieh, Leang S.; Dib, Hani M.; Ganesan, Sekar

1987-01-01

A method for optimally shifting the imaginary parts of the open-loop poles of a multivariable control system to the desirable closed-loop locations is presented. The optimal solution with respect to a quadratic performance index is obtained by solving a linear matrix Liapunov equation.

Wave propagation through a flexoelectric piezoelectric slab sandwiched by two piezoelectric half-spaces.

PubMed

Jiao, Fengyu; Wei, Peijun; Li, Yueqiu

2018-01-01

Reflection and transmission of plane waves through a flexoelectric piezoelectric slab sandwiched by two piezoelectric half-spaces are studied in this paper. The secular equations in the flexoelectric piezoelectric material are first derived from the general governing equation. Different from the classical piezoelectric medium, there are five kinds of coupled elastic waves in the piezoelectric material with the microstructure effects taken into consideration. The state vectors are obtained by the summation of contributions from all possible partial waves. The state transfer equation of flexoelectric piezoelectric slab is derived from the motion equation by the reduction of order, and the transfer matrix of flexoelectric piezoelectric slab is obtained by solving the state transfer equation. By using the continuous conditions at the interface and the approach of partition matrix, we get the resultant algebraic equations in term of the transfer matrix from which the reflection and transmission coefficients can be calculated. The amplitude ratios and further the energy flux ratios of various waves are evaluated numerically. The numerical results are shown graphically and are validated by the energy conservation law. Based on these numerical results, the influences of two characteristic lengths of microstructure and the flexoelectric coefficients on the wave propagation are discussed. Copyright © 2017 Elsevier B.V. All rights reserved.

A Walsh Function Module Users' Manual

NASA Technical Reports Server (NTRS)

Gnoffo, Peter A.

2014-01-01

The solution of partial differential equations (PDEs) with Walsh functions offers new opportunities to simulate many challenging problems in mathematical physics. The approach was developed to better simulate hypersonic flows with shocks on unstructured grids. It is unique in that integrals and derivatives are computed using simple matrix multiplication of series representations of functions without the need for divided differences. The product of any two Walsh functions is another Walsh function - a feature that radically changes an algorithm for solving PDEs. A FORTRAN module for supporting Walsh function simulations is documented. A FORTRAN code is also documented with options for solving time-dependent problems: an advection equation, a Burgers equation, and a Riemann problem. The sample problems demonstrate the usage of the Walsh function module including such features as operator overloading, Fast Walsh Transforms in multi-dimensions, and a Fast Walsh reciprocal.

Blockwise conjugate gradient methods for image reconstruction in volumetric CT.

PubMed

Qiu, W; Titley-Peloquin, D; Soleimani, M

2012-11-01

Cone beam computed tomography (CBCT) enables volumetric image reconstruction from 2D projection data and plays an important role in image guided radiation therapy (IGRT). Filtered back projection is still the most frequently used algorithm in applications. The algorithm discretizes the scanning process (forward projection) into a system of linear equations, which must then be solved to recover images from measured projection data. The conjugate gradients (CG) algorithm and its variants can be used to solve (possibly regularized) linear systems of equations Ax=b and linear least squares problems minx∥b-Ax∥2, especially when the matrix A is very large and sparse. Their applications can be found in a general CT context, but in tomography problems (e.g. CBCT reconstruction) they have not widely been used. Hence, CBCT reconstruction using the CG-type algorithm LSQR was implemented and studied in this paper. In CBCT reconstruction, the main computational challenge is that the matrix A usually is very large, and storing it in full requires an amount of memory well beyond the reach of commodity computers. Because of these memory capacity constraints, only a small fraction of the weighting matrix A is typically used, leading to a poor reconstruction. In this paper, to overcome this difficulty, the matrix A is partitioned and stored blockwise, and blockwise matrix-vector multiplications are implemented within LSQR. This implementation allows us to use the full weighting matrix A for CBCT reconstruction without further enhancing computer standards. Tikhonov regularization can also be implemented in this fashion, and can produce significant improvement in the reconstructed images. Copyright © 2011 Elsevier Ireland Ltd. All rights reserved.

Simulation of naturally fractured reservoirs

DOE Office of Scientific and Technical Information (OSTI.GOV)

Saidi, A.M.

1983-11-01

A three-dimensional, three-phase reservoir simulator was developed to study the behavior of fully or partially fractured reservoirs. It is also demonstrated, that when a fractured reservoir is subject to a relatively large rate of pressure drop and/or it composed of relatively large blocks, the pseudo steady-state pressure concept gives large errors as compared with transient fromulation. In addition, when gravity drainage and imbibitum processes, which is the most important mechanism in the fractured reservoirs, are represented by a ''lumped parameter'' even larger errors can be produced in exchange flow between matrix and fractures. For these reasons, the matrix blocks aremore » gridded and the transfer between matrix and fractures are calculated using pressure and diffusion transient concept. In this way the gravity drainage is also calculated accurately. As the matrix-fracture exchange flow depends on the location of each matrix grid relative to the GOC and/or WOC in fracture, the exchange flow equation are derived and given for each possible case. The differential equation describing the flow of water, oil, and gas within the matrix and fracture system, each of which may contain six unknowns, are presented. The two sets of equations are solved implicitly for pressure water, and gas stauration in both matrix and fractures. The first twenty two years of the history of Haft Kel field was successfully matched with this model and the results are included.« less

Spherical space Bessel-Legendre-Fourier localized modes solver for electromagnetic waves.

PubMed

Alzahrani, Mohammed A; Gauthier, Robert C

2015-10-05

Maxwell's vector wave equations are solved for dielectric configurations that match the symmetry of a spherical computational domain. The electric or magnetic field components and the inverse of the dielectric profile are series expansion defined using basis functions composed of the lowest order spherical Bessel function, polar angle single index dependant Legendre polynomials and azimuthal complex exponential (BLF). The series expressions and non-traditional form of the basis functions result in an eigenvalue matrix formulation of Maxwell's equations that are relatively compact and accurately solvable on a desktop PC. The BLF matrix returns the frequencies and field profiles for steady states modes. The key steps leading to the matrix populating expressions are provided. The validity of the numerical technique is confirmed by comparing the results of computations to those published using complementary techniques.

HFEM3D

DOE Office of Scientific and Technical Information (OSTI.GOV)

Weiss, Chester J

Software solves the three-dimensional Poisson equation div(k(grad(u)) = f, by the finite element method for the case when material properties, k, are distributed over hierarchy of edges, facets and tetrahedra in the finite element mesh. Method is described in Weiss, CJ, Finite element analysis for model parameters distributed on a hierarchy of geometric simplices, Geophysics, v82, E155-167, doi:10.1190/GEO2017-0058.1 (2017). A standard finite element method for solving Poisson’s equation is augmented by including in the 3D stiffness matrix additional 2D and 1D stiffness matrices representing the contributions from material properties associated with mesh faces and edges, respectively. The resulting linear systemmore » is solved iteratively using the conjugate gradient method with Jacobi preconditioning. To minimize computer storage for program execution, the linear solver computes matrix-vector contractions element-by-element over the mesh, without explicit storage of the global stiffness matrix. Program output vtk compliant for visualization and rendering by 3rd party software. Program uses dynamic memory allocation and as such there are no hard limits on problem size outside of those imposed by the operating system and configuration on which the software is run. Dimension, N, of the finite element solution vector is constrained by the the addressable space in 32-vs-64 bit operating systems. Total storage requirements for the problem. Total working space required for the program is approximately 13*N double precision words.« less

Unified Theory for Decoding the Signals from X-Ray Florescence and X-Ray Diffraction of Mixtures.

PubMed

Chung, Frank H

2017-05-01

For research and development or for solving technical problems, we often need to know the chemical composition of an unknown mixture, which is coded and stored in the signals of its X-ray fluorescence (XRF) and X-ray diffraction (XRD). X-ray fluorescence gives chemical elements, whereas XRD gives chemical compounds. The major problem in XRF and XRD analyses is the complex matrix effect. The conventional technique to deal with the matrix effect is to construct empirical calibration lines with standards for each element or compound sought, which is tedious and time-consuming. A unified theory of quantitative XRF analysis is presented here. The idea is to cancel the matrix effect mathematically. It turns out that the decoding equation for quantitative XRF analysis is identical to that for quantitative XRD analysis although the physics of XRD and XRF are fundamentally different. The XRD work has been published and practiced worldwide. The unified theory derives a new intensity-concentration equation of XRF, which is free from the matrix effect and valid for a wide range of concentrations. The linear decoding equation establishes a constant slope for each element sought, hence eliminating the work on calibration lines. The simple linear decoding equation has been verified by 18 experiments.

Optical systolic array processor using residue arithmetic

NASA Technical Reports Server (NTRS)

Jackson, J.; Casasent, D.

1983-01-01

The use of residue arithmetic to increase the accuracy and reduce the dynamic range requirements of optical matrix-vector processors is evaluated. It is determined that matrix-vector operations and iterative algorithms can be performed totally in residue notation. A new parallel residue quantizer circuit is developed which significantly improves the performance of the systolic array feedback processor. Results are presented of a computer simulation of this system used to solve a set of three simultaneous equations.

Electromagnetic scattering calculations on the Intel Touchstone Delta

NASA Technical Reports Server (NTRS)

Cwik, Tom; Patterson, Jean; Scott, David

1992-01-01

During the first year's operation of the Intel Touchstone Delta system, software which solves the electric field integral equations for fields scattered from arbitrarily shaped objects has been transferred to the Delta. To fully realize the Delta's resources, an out-of-core dense matrix solution algorithm that utilizes some or all of the 90 Gbyte of concurrent file system (CFS) has been used. The largest calculation completed to date computes the fields scattered from a perfectly conducting sphere modeled by 48,672 unknown functions, resulting in a complex valued dense matrix needing 37.9 Gbyte of storage. The out-of-core LU matrix factorization algorithm was executed in 8.25 h at a rate of 10.35 Gflops. Total time to complete the calculation was 19.7 h-the additional time was used to compute the 48,672 x 48,672 matrix entries, solve the system for a given excitation, and compute observable quantities. The calculation was performed in 64-b precision.

Technical note: Avoiding the direct inversion of the numerator relationship matrix for genotyped animals in single-step genomic best linear unbiased prediction solved with the preconditioned conjugate gradient.

PubMed

Masuda, Y; Misztal, I; Legarra, A; Tsuruta, S; Lourenco, D A L; Fragomeni, B O; Aguilar, I

2017-01-01

This paper evaluates an efficient implementation to multiply the inverse of a numerator relationship matrix for genotyped animals () by a vector (). The computation is required for solving mixed model equations in single-step genomic BLUP (ssGBLUP) with the preconditioned conjugate gradient (PCG). The inverse can be decomposed into sparse matrices that are blocks of the sparse inverse of a numerator relationship matrix () including genotyped animals and their ancestors. The elements of were rapidly calculated with the Henderson's rule and stored as sparse matrices in memory. Implementation of was by a series of sparse matrix-vector multiplications. Diagonal elements of , which were required as preconditioners in PCG, were approximated with a Monte Carlo method using 1,000 samples. The efficient implementation of was compared with explicit inversion of with 3 data sets including about 15,000, 81,000, and 570,000 genotyped animals selected from populations with 213,000, 8.2 million, and 10.7 million pedigree animals, respectively. The explicit inversion required 1.8 GB, 49 GB, and 2,415 GB (estimated) of memory, respectively, and 42 s, 56 min, and 13.5 d (estimated), respectively, for the computations. The efficient implementation required <1 MB, 2.9 GB, and 2.3 GB of memory, respectively, and <1 sec, 3 min, and 5 min, respectively, for setting up. Only <1 sec was required for the multiplication in each PCG iteration for any data sets. When the equations in ssGBLUP are solved with the PCG algorithm, is no longer a limiting factor in the computations.

Unsteady Solution of Non-Linear Differential Equations Using Walsh Function Series

NASA Technical Reports Server (NTRS)

Gnoffo, Peter A.

2015-01-01

Walsh functions form an orthonormal basis set consisting of square waves. The discontinuous nature of square waves make the system well suited for representing functions with discontinuities. The product of any two Walsh functions is another Walsh function - a feature that can radically change an algorithm for solving non-linear partial differential equations (PDEs). The solution algorithm of non-linear differential equations using Walsh function series is unique in that integrals and derivatives may be computed using simple matrix multiplication of series representations of functions. Solutions to PDEs are derived as functions of wave component amplitude. Three sample problems are presented to illustrate the Walsh function series approach to solving unsteady PDEs. These include an advection equation, a Burgers equation, and a Riemann problem. The sample problems demonstrate the use of the Walsh function solution algorithms, exploiting Fast Walsh Transforms in multi-dimensions (O(Nlog(N))). Details of a Fast Walsh Reciprocal, defined here for the first time, enable inversion of aWalsh Symmetric Matrix in O(Nlog(N)) operations. Walsh functions have been derived using a fractal recursion algorithm and these fractal patterns are observed in the progression of pairs of wave number amplitudes in the solutions. These patterns are most easily observed in a remapping defined as a fractal fingerprint (FFP). A prolongation of existing solutions to the next highest order exploits these patterns. The algorithms presented here are considered a work in progress that provide new alternatives and new insights into the solution of non-linear PDEs.

Sparse matrix methods research using the CSM testbed software system

NASA Technical Reports Server (NTRS)

Chu, Eleanor; George, J. Alan

1989-01-01

Research is described on sparse matrix techniques for the Computational Structural Mechanics (CSM) Testbed. The primary objective was to compare the performance of state-of-the-art techniques for solving sparse systems with those that are currently available in the CSM Testbed. Thus, one of the first tasks was to become familiar with the structure of the testbed, and to install some or all of the SPARSPAK package in the testbed. A suite of subroutines to extract from the data base the relevant structural and numerical information about the matrix equations was written, and all the demonstration problems distributed with the testbed were successfully solved. These codes were documented, and performance studies comparing the SPARSPAK technology to the methods currently in the testbed were completed. In addition, some preliminary studies were done comparing some recently developed out-of-core techniques with the performance of the testbed processor INV.

Anderson acceleration and application to the three-temperature energy equations

NASA Astrophysics Data System (ADS)

An, Hengbin; Jia, Xiaowei; Walker, Homer F.

2017-10-01

The Anderson acceleration method is an algorithm for accelerating the convergence of fixed-point iterations, including the Picard method. Anderson acceleration was first proposed in 1965 and, for some years, has been used successfully to accelerate the convergence of self-consistent field iterations in electronic-structure computations. Recently, the method has attracted growing attention in other application areas and among numerical analysts. Compared with a Newton-like method, an advantage of Anderson acceleration is that there is no need to form the Jacobian matrix. Thus the method is easy to implement. In this paper, an Anderson-accelerated Picard method is employed to solve the three-temperature energy equations, which are a type of strong nonlinear radiation-diffusion equations. Two strategies are used to improve the robustness of the Anderson acceleration method. One strategy is to adjust the iterates when necessary to satisfy the physical constraint. Another strategy is to monitor and, if necessary, reduce the matrix condition number of the least-squares problem in the Anderson-acceleration implementation so that numerical stability can be guaranteed. Numerical results show that the Anderson-accelerated Picard method can solve the three-temperature energy equations efficiently. Compared with the Picard method without acceleration, Anderson acceleration can reduce the number of iterations by at least half. A comparison between a Jacobian-free Newton-Krylov method, the Picard method, and the Anderson-accelerated Picard method is conducted in this paper.

Fast Multilevel Solvers for a Class of Discrete Fourth Order Parabolic Problems

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zheng, Bin; Chen, Luoping; Hu, Xiaozhe

2016-03-05

In this paper, we study fast iterative solvers for the solution of fourth order parabolic equations discretized by mixed finite element methods. We propose to use consistent mass matrix in the discretization and use lumped mass matrix to construct efficient preconditioners. We provide eigenvalue analysis for the preconditioned system and estimate the convergence rate of the preconditioned GMRes method. Furthermore, we show that these preconditioners only need to be solved inexactly by optimal multigrid algorithms. Our numerical examples indicate that the proposed preconditioners are very efficient and robust with respect to both discretization parameters and diffusion coefficients. We also investigatemore » the performance of multigrid algorithms with either collective smoothers or distributive smoothers when solving the preconditioner systems.« less

Users manual for the Variable dimension Automatic Synthesis Program (VASP)

NASA Technical Reports Server (NTRS)

White, J. S.; Lee, H. Q.

1971-01-01

A dictionary and some problems for the Variable Automatic Synthesis Program VASP are submitted. The dictionary contains a description of each subroutine and instructions on its use. The example problems give the user a better perspective on the use of VASP for solving problems in modern control theory. These example problems include dynamic response, optimal control gain, solution of the sampled data matrix Ricatti equation, matrix decomposition, and pseudo inverse of a matrix. Listings of all subroutines are also included. The VASP program has been adapted to run in the conversational mode on the Ames 360/67 computer.

A decentralized process for finding equilibria given by linear equations.

PubMed Central

Reiter, S

1994-01-01

I present a decentralized process for finding the equilibria of an economy characterized by a finite number of linear equilibrium conditions. The process finds all equilibria or, if there are none, reports that, in a finite number of steps at most equal to the number of equations. The communication and computational complexity compare favorably with other decentralized processes. The process may also be interpreted as an algorithm for solving a distributed system of linear equations. Comparisons with the Linpack program for LU (lower and upper triangular decomposition of the matrix of the equation system, a version of Gaussian elimination) are presented. PMID:11607486

Homotopy approach to optimal, linear quadratic, fixed architecture compensation

NASA Technical Reports Server (NTRS)

Mercadal, Mathieu

1991-01-01

Optimal linear quadratic Gaussian compensators with constrained architecture are a sensible way to generate good multivariable feedback systems meeting strict implementation requirements. The optimality conditions obtained from the constrained linear quadratic Gaussian are a set of highly coupled matrix equations that cannot be solved algebraically except when the compensator is centralized and full order. An alternative to the use of general parameter optimization methods for solving the problem is to use homotopy. The benefit of the method is that it uses the solution to a simplified problem as a starting point and the final solution is then obtained by solving a simple differential equation. This paper investigates the convergence properties and the limitation of such an approach and sheds some light on the nature and the number of solutions of the constrained linear quadratic Gaussian problem. It also demonstrates the usefulness of homotopy on an example of an optimal decentralized compensator.

A comparative study of diffraction of shallow-water waves by high-level IGN and GN equations

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zhao, B.B.; Ertekin, R.C.; College of Shipbuilding Engineering, Harbin Engineering University, 150001 Harbin

2015-02-15

This work is on the nonlinear diffraction analysis of shallow-water waves, impinging on submerged obstacles, by two related theories, namely the classical Green–Naghdi (GN) equations and the Irrotational Green–Naghdi (IGN) equations, both sets of equations being at high levels and derived for incompressible and inviscid flows. Recently, the high-level Green–Naghdi equations have been applied to some wave transformation problems. The high-level IGN equations have also been used in the last decade to study certain wave propagation problems. However, past works on these theories used different numerical methods to solve these nonlinear and unsteady sets of differential equations and at differentmore » levels. Moreover, different physical problems have been solved in the past. Therefore, it has not been possible to understand the differences produced by these two sets of theories and their range of applicability so far. We are thus motivated to make a direct comparison of the results produced by these theories by use of the same numerical method to solve physically the same wave diffraction problems. We focus on comparing these two theories by using similar codes; only the equations used are different but other parts of the codes, such as the wave-maker, damping zone, discretion method, matrix solver, etc., are exactly the same. This way, we eliminate many potential sources of differences that could be produced by the solution of different equations. The physical problems include the presence of various submerged obstacles that can be used for example as breakwaters or to represent the continental shelf. A numerical wave tank is created by placing a wavemaker on one end and a wave absorbing beach on the other. The nonlinear and unsteady sets of differential equations are solved by the finite-difference method. The results are compared with different equations as well as with the available experimental data.« less

A comparative study of diffraction of shallow-water waves by high-level IGN and GN equations

NASA Astrophysics Data System (ADS)

Zhao, B. B.; Ertekin, R. C.; Duan, W. Y.

2015-02-01

This work is on the nonlinear diffraction analysis of shallow-water waves, impinging on submerged obstacles, by two related theories, namely the classical Green-Naghdi (GN) equations and the Irrotational Green-Naghdi (IGN) equations, both sets of equations being at high levels and derived for incompressible and inviscid flows. Recently, the high-level Green-Naghdi equations have been applied to some wave transformation problems. The high-level IGN equations have also been used in the last decade to study certain wave propagation problems. However, past works on these theories used different numerical methods to solve these nonlinear and unsteady sets of differential equations and at different levels. Moreover, different physical problems have been solved in the past. Therefore, it has not been possible to understand the differences produced by these two sets of theories and their range of applicability so far. We are thus motivated to make a direct comparison of the results produced by these theories by use of the same numerical method to solve physically the same wave diffraction problems. We focus on comparing these two theories by using similar codes; only the equations used are different but other parts of the codes, such as the wave-maker, damping zone, discretion method, matrix solver, etc., are exactly the same. This way, we eliminate many potential sources of differences that could be produced by the solution of different equations. The physical problems include the presence of various submerged obstacles that can be used for example as breakwaters or to represent the continental shelf. A numerical wave tank is created by placing a wavemaker on one end and a wave absorbing beach on the other. The nonlinear and unsteady sets of differential equations are solved by the finite-difference method. The results are compared with different equations as well as with the available experimental data.

Methodology for Sensitivity Analysis, Approximate Analysis, and Design Optimization in CFD for Multidisciplinary Applications

NASA Technical Reports Server (NTRS)

Taylor, Arthur C., III; Hou, Gene W.

1996-01-01

An incremental iterative formulation together with the well-known spatially split approximate-factorization algorithm, is presented for solving the large, sparse systems of linear equations that are associated with aerodynamic sensitivity analysis. This formulation is also known as the 'delta' or 'correction' form. For the smaller two dimensional problems, a direct method can be applied to solve these linear equations in either the standard or the incremental form, in which case the two are equivalent. However, iterative methods are needed for larger two-dimensional and three dimensional applications because direct methods require more computer memory than is currently available. Iterative methods for solving these equations in the standard form are generally unsatisfactory due to an ill-conditioned coefficient matrix; this problem is overcome when these equations are cast in the incremental form. The methodology is successfully implemented and tested using an upwind cell-centered finite-volume formulation applied in two dimensions to the thin-layer Navier-Stokes equations for external flow over an airfoil. In three dimensions this methodology is demonstrated with a marching-solution algorithm for the Euler equations to calculate supersonic flow over the High-Speed Civil Transport configuration (HSCT 24E). The sensitivity derivatives obtained with the incremental iterative method from a marching Euler code are used in a design-improvement study of the HSCT configuration that involves thickness. camber, and planform design variables.

Nonlinear mechanical behavior of thermoplastic matrix materials for advanced composites

NASA Technical Reports Server (NTRS)

Arenz, R. J.; Landel, R. F.

1989-01-01

Two recent theories of nonlinear mechanical response are quantitatively compared and related to experimental data. Computer techniques are formulated to handle the numerical integration and iterative procedures needed to solve the associated sets of coupled nonlinear differential equations. Problems encountered during these formulations are discussed and some open questions described. Bearing in mind these cautions, the consequences of changing parameters that appear in the formulations on the resulting engineering properties are discussed. Hence, engineering approaches to the analysis of thermoplastic matrix material can be suggested.

Single-Sided Noinvasive Inspection of Multielement Sample Using Fan-Beam Multiplexed Compton Scatter Tomography

DTIC Science & Technology

2000-05-01

a vector , ρ "# represents the set of voxel densities sorted into a vector , and ( )A ρ $# "# represents a 8 mapping of the voxel densities to...density vector in equation (4) suggests that solving for ρ "# by direct inversion is not possible, calling for an iterative technique beginning with...the vector of measured spectra, and D is the diagonal matrix of the inverse of the variances. The diagonal matrix provides weighting terms, which

KANTBP: A program for computing energy levels, reaction matrix and radial wave functions in the coupled-channel hyperspherical adiabatic approach

NASA Astrophysics Data System (ADS)

Chuluunbaatar, O.; Gusev, A. A.; Abrashkevich, A. G.; Amaya-Tapia, A.; Kaschiev, M. S.; Larsen, S. Y.; Vinitsky, S. I.

2007-10-01

A FORTRAN 77 program is presented which calculates energy values, reaction matrix and corresponding radial wave functions in a coupled-channel approximation of the hyperspherical adiabatic approach. In this approach, a multi-dimensional Schrödinger equation is reduced to a system of the coupled second-order ordinary differential equations on the finite interval with homogeneous boundary conditions of the third type. The resulting system of radial equations which contains the potential matrix elements and first-derivative coupling terms is solved using high-order accuracy approximations of the finite-element method. As a test desk, the program is applied to the calculation of the energy values and reaction matrix for an exactly solvable 2D-model of three identical particles on a line with pair zero-range potentials. Program summaryProgram title: KANTBP Catalogue identifier: ADZH_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/ADZH_v1_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.html No. of lines in distributed program, including test data, etc.: 4224 No. of bytes in distributed program, including test data, etc.: 31 232 Distribution format: tar.gz Programming language: FORTRAN 77 Computer: Intel Xeon EM64T, Alpha 21264A, AMD Athlon MP, Pentium IV Xeon, Opteron 248, Intel Pentium IV Operating system: OC Linux, Unix AIX 5.3, SunOS 5.8, Solaris, Windows XP RAM: depends on (a) the number of differential equations; (b) the number and order of finite-elements; (c) the number of hyperradial points; and (d) the number of eigensolutions required. Test run requires 30 MB Classification: 2.1, 2.4 External routines: GAULEG and GAUSSJ [W.H. Press, B.F. Flanery, S.A. Teukolsky, W.T. Vetterley, Numerical Recipes: The Art of Scientific Computing, Cambridge University Press, Cambridge, 1986] Nature of problem: In the hyperspherical adiabatic approach [J. Macek, J. Phys. B 1 (1968) 831-843; U. Fano, Rep. Progr. Phys. 46 (1983) 97-165; C.D. Lin, Adv. Atom. Mol. Phys. 22 (1986) 77-142], a multi-dimensional Schrödinger equation for a two-electron system [A.G. Abrashkevich, D.G. Abrashkevich, M. Shapiro, Comput. Phys. Comm. 90 (1995) 311-339] or a hydrogen atom in magnetic field [M.G. Dimova, M.S. Kaschiev, S.I. Vinitsky, J. Phys. B 38 (2005) 2337-2352] is reduced by separating the radial coordinate ρ from the angular variables to a system of second-order ordinary differential equations which contain potential matrix elements and first-derivative coupling terms. The purpose of this paper is to present the finite-element method procedure based on the use of high-order accuracy approximations for calculating approximate eigensolutions for such systems of coupled differential equations. Solution method: The boundary problems for coupled differential equations are solved by the finite-element method using high-order accuracy approximations [A.G. Abrashkevich, D.G. Abrashkevich, M.S. Kaschiev, I.V. Puzynin, Comput. Phys. Comm. 85 (1995) 40-64]. The generalized algebraic eigenvalue problem AF=EBF with respect to pair unknowns ( E,F) arising after the replacement of the differential problem by the finite-element approximation is solved by the subspace iteration method using the SSPACE program [K.J. Bathe, Finite Element Procedures in Engineering Analysis, Englewood Cliffs, Prentice-Hall, New York, 1982]. The generalized algebraic eigenvalue problem (A-EB)F=λDF with respect to pair unknowns (λ,F) arising after the corresponding replacement of the scattering boundary problem in open channels at fixed energy value, E, is solved by the LDL factorization of symmetric matrix and back-substitution methods using the DECOMP and REDBAK programs, respectively [K.J. Bathe, Finite Element Procedures in Engineering Analysis, Englewood Cliffs, Prentice-Hall, New York, 1982]. As a test desk, the program is applied to the calculation of the energy values and reaction matrix for an exactly solvable 2D-model of three identical particles on a line with pair zero-range potentials described in [Yu. A. Kuperin, P.B. Kurasov, Yu.B. Melnikov, S.P. Merkuriev, Ann. Phys. 205 (1991) 330-361; O. Chuluunbaatar, A.A. Gusev, S.Y. Larsen, S.I. Vinitsky, J. Phys. A 35 (2002) L513-L525; N.P. Mehta, J.R. Shepard, Phys. Rev. A 72 (2005) 032728-1-11; O. Chuluunbaatar, A.A. Gusev, M.S. Kaschiev, V.A. Kaschieva, A. Amaya-Tapia, S.Y. Larsen, S.I. Vinitsky, J. Phys. B 39 (2006) 243-269]. For this benchmark model the needed analytical expressions for the potential matrix elements and first-derivative coupling terms, their asymptotics and asymptotics of radial solutions of the boundary problems for coupled differential equations have been produced with help of a MAPLE computer algebra system. Restrictions: The computer memory requirements depend on: (a) the number of differential equations; (b) the number and order of finite-elements; (c) the total number of hyperradial points; and (d) the number of eigensolutions required. Restrictions due to dimension sizes may be easily alleviated by altering PARAMETER statements (see Long Write-Up and listing for details). The user must also supply subroutine POTCAL for evaluating potential matrix elements. The user should supply subroutines ASYMEV (when solving the eigenvalue problem) or ASYMSC (when solving the scattering problem) that evaluate the asymptotics of the radial wave functions at the right boundary point in case of a boundary condition of the third type, respectively. Running time: The running time depends critically upon: (a) the number of differential equations; (b) the number and order of finite-elements; (c) the total number of hyperradial points on interval [0,ρ]; and (d) the number of eigensolutions required. The test run which accompanies this paper took 28.48 s without calculation of matrix potentials on the Intel Pentium IV 2.4 GHz.

Three-dimensional unstructured grid Euler computations using a fully-implicit, upwind method

NASA Technical Reports Server (NTRS)

Whitaker, David L.

1993-01-01

A method has been developed to solve the Euler equations on a three-dimensional unstructured grid composed of tetrahedra. The method uses an upwind flow solver with a linearized, backward-Euler time integration scheme. Each time step results in a sparse linear system of equations which is solved by an iterative, sparse matrix solver. Local-time stepping, switched evolution relaxation (SER), preconditioning and reuse of the Jacobian are employed to accelerate the convergence rate. Implicit boundary conditions were found to be extremely important for fast convergence. Numerical experiments have shown that convergence rates comparable to that of a multigrid, central-difference scheme are achievable on the same mesh. Results are presented for several grids about an ONERA M6 wing.

A preconditioner for the finite element computation of incompressible, nonlinear elastic deformations

NASA Astrophysics Data System (ADS)

Whiteley, J. P.

2017-10-01

Large, incompressible elastic deformations are governed by a system of nonlinear partial differential equations. The finite element discretisation of these partial differential equations yields a system of nonlinear algebraic equations that are usually solved using Newton's method. On each iteration of Newton's method, a linear system must be solved. We exploit the structure of the Jacobian matrix to propose a preconditioner, comprising two steps. The first step is the solution of a relatively small, symmetric, positive definite linear system using the preconditioned conjugate gradient method. This is followed by a small number of multigrid V-cycles for a larger linear system. Through the use of exemplar elastic deformations, the preconditioner is demonstrated to facilitate the iterative solution of the linear systems arising. The number of GMRES iterations required has only a very weak dependence on the number of degrees of freedom of the linear systems.

Quantum trajectories for time-dependent adiabatic master equations

NASA Astrophysics Data System (ADS)

Yip, Ka Wa; Albash, Tameem; Lidar, Daniel A.

2018-02-01

We describe a quantum trajectories technique for the unraveling of the quantum adiabatic master equation in Lindblad form. By evolving a complex state vector of dimension N instead of a complex density matrix of dimension N2, simulations of larger system sizes become feasible. The cost of running many trajectories, which is required to recover the master equation evolution, can be minimized by running the trajectories in parallel, making this method suitable for high performance computing clusters. In general, the trajectories method can provide up to a factor N advantage over directly solving the master equation. In special cases where only the expectation values of certain observables are desired, an advantage of up to a factor N2 is possible. We test the method by demonstrating agreement with direct solution of the quantum adiabatic master equation for 8-qubit quantum annealing examples. We also apply the quantum trajectories method to a 16-qubit example originally introduced to demonstrate the role of tunneling in quantum annealing, which is significantly more time consuming to solve directly using the master equation. The quantum trajectories method provides insight into individual quantum jump trajectories and their statistics, thus shedding light on open system quantum adiabatic evolution beyond the master equation.

A novel technique to solve nonlinear higher-index Hessenberg differential-algebraic equations by Adomian decomposition method.

PubMed

Benhammouda, Brahim

2016-01-01

Since 1980, the Adomian decomposition method (ADM) has been extensively used as a simple powerful tool that applies directly to solve different kinds of nonlinear equations including functional, differential, integro-differential and algebraic equations. However, for differential-algebraic equations (DAEs) the ADM is applied only in four earlier works. There, the DAEs are first pre-processed by some transformations like index reductions before applying the ADM. The drawback of such transformations is that they can involve complex algorithms, can be computationally expensive and may lead to non-physical solutions. The purpose of this paper is to propose a novel technique that applies the ADM directly to solve a class of nonlinear higher-index Hessenberg DAEs systems efficiently. The main advantage of this technique is that; firstly it avoids complex transformations like index reductions and leads to a simple general algorithm. Secondly, it reduces the computational work by solving only linear algebraic systems with a constant coefficient matrix at each iteration, except for the first iteration where the algebraic system is nonlinear (if the DAE is nonlinear with respect to the algebraic variable). To demonstrate the effectiveness of the proposed technique, we apply it to a nonlinear index-three Hessenberg DAEs system with nonlinear algebraic constraints. This technique is straightforward and can be programmed in Maple or Mathematica to simulate real application problems.

Asymptotic (h tending to infinity) absolute stability for BDFs applied to stiff differential equations. [Backward Differentiation Formulas

NASA Technical Reports Server (NTRS)

Krogh, F. T.; Stewart, K.

1984-01-01

Methods based on backward differentiation formulas (BDFs) for solving stiff differential equations require iterating to approximate the solution of the corrector equation on each step. One hope for reducing the cost of this is to make do with iteration matrices that are known to have errors and to do no more iterations than are necessary to maintain the stability of the method. This paper, following work by Klopfenstein, examines the effect of errors in the iteration matrix on the stability of the method. Application of the results to an algorithm is discussed briefly.

Flow model for open-channel reach or network

USGS Publications Warehouse

Schaffranek, R.W.

1987-01-01

Formulation of a one-dimensional model for simulating unsteady flow in a single open-channel reach or in a network of interconnected channels is presented. The model is both general and flexible in that it can be used to simulate a wide range of flow conditions for various channel configurations. It is based on a four-point (box), implicit, finite-difference approximation of the governing nonlinear flow equations with user-definable weighting coefficients to permit varying the solution scheme from box-centered to fully forward. Unique transformation equations are formulated that permit correlation of the unknowns at the extremities of the channels, thereby reducing coefficient matrix and execution time requirements. Discharges and water-surface elevations computed at intermediate locations within a channel are determined following solution of the transformation equations. The matrix of transformation and boundary-condition equations is solved by Gauss elimination using maximum pivot strategy. Two diverse applications of the model are presented to illustrate its broad utility. (USGS)

Matrix-Free Polynomial-Based Nonlinear Least Squares Optimized Preconditioning and its Application to Discontinuous Galerkin Discretizations of the Euler Equations

DTIC Science & Technology

2015-06-01

cient parallel code for applying the operator. Our method constructs a polynomial preconditioner using a nonlinear least squares (NLLS) algorithm. We show...apply the underlying operator. Such a preconditioner can be very attractive in scenarios where one has a highly efficient parallel code for applying...repeatedly solve a large system of linear equations where one has an extremely fast parallel code for applying an underlying fixed linear operator

Entropy Production and Non-Equilibrium Steady States

NASA Astrophysics Data System (ADS)

Suzuki, Masuo

2013-01-01

The long-term issue of entropy production in transport phenomena is solved by separating the symmetry of the non-equilibrium density matrix ρ(t) in the von Neumann equation, as ρ(t) = ρs(t) + ρa(t) with the symmetric part ρs(t) and antisymmetric part ρa(t). The irreversible entropy production (dS/dt)irr is given in M. Suzuki, Physica A 390(2011)1904 by (dS/dt)irr = Tr( {H}(dρ s{(t)/dt))}/T for the Hamiltonian {H} of the relevant system. The general formulation of the extended von Neumann equation with energy supply and heat extraction is reviewed from the author's paper (M. S.,Physica A391(2012)1074). irreversibility; entropy production; transport phenomena; electric conduction; thermal conduction; linear response; Kubo formula; steady state; non-equilibrium density matrix; energy supply; symmetry-separated von Neumann equation; unboundedness.

Kraus operator solutions to a fermionic master equation describing a thermal bath and their matrix representation

NASA Astrophysics Data System (ADS)

Xiang-Guo, Meng; Ji-Suo, Wang; Hong-Yi, Fan; Cheng-Wei, Xia

2016-04-01

We solve the fermionic master equation for a thermal bath to obtain its explicit Kraus operator solutions via the fermionic state approach. The normalization condition of the Kraus operators is proved. The matrix representation for these solutions is obtained, which is incongruous with the result in the book completed by Nielsen and Chuang [Quantum Computation and Quantum Information, Cambridge University Press, 2000]. As especial cases, we also present the Kraus operator solutions to master equations for describing the amplitude-decay model and the diffusion process at finite temperature. Project supported by the National Natural Science Foundation of China (Grant No. 11347026), the Natural Science Foundation of Shandong Province, China (Grant Nos. ZR2013AM012 and ZR2012AM004), and the Research Fund for the Doctoral Program and Scientific Research Project of Liaocheng University, Shandong Province, China.

Interaction between a circular inclusion and an arbitrarily oriented crack

NASA Technical Reports Server (NTRS)

Erdogan, F.; Gupta, G. D.; Ratwani, M.

1975-01-01

The plane interaction problem for a circular elastic inclusion embedded in an elastic matrix which contains an arbitrarily oriented crack is considered. Using the existing solutions for the edge dislocations as Green's functions, first the general problem of a through crack in the form of an arbitrary smooth arc located in the matrix in the vicinity of the inclusion is formulated. The integral equations for the line crack are then obtained as a system of singular integral equations with simple Cauchy kernels. The singular behavior of the stresses around the crack tips is examined and the expressions for the stress-intensity factors representing the strength of the stress singularities are obtained in terms of the asymptotic values of the density functions of the integral equations. The problem is solved for various typical crack orientations and the corresponding stress-intensity factors are given.

An extension to the Chahine method of inverting the radiative transfer equation. [application to ozone distribution in atmosphere

NASA Technical Reports Server (NTRS)

Twomey, S.; Herman, B.; Rabinoff, R.

1977-01-01

An extension of the Chahine relaxation method (1970) for inverting the radiative transfer equation is presented. This method is superior to the original method in that it takes into account in a realistic manner the shape of the kernel function, and its extension to nonlinear systems is much more straightforward. A comparison of the new method with a matrix method due to Twomey (1965), in a problem involving inference of vertical distribution of ozone from spectroscopic measurements in the near ultraviolet, indicates that in this situation this method is stable with errors in the input data up to 4%, whereas the matrix method breaks down at these levels. The problem of non-uniqueness of the solution, which is a property of the system of equations rather than of any particular algorithm for solving them, remains, although it takes on slightly different forms for the two algorithms.

Using Excel's Matrix Operations to Facilitate Reciprocal Cost Allocations

ERIC Educational Resources Information Center

Leese, Wallace R.; Kizirian, Tim

2009-01-01

The reciprocal method of service department cost allocation requires linear equations to be solved simultaneously. These computations are often so complex as to cause the abandonment of the reciprocal method in favor of the less sophisticated direct or step-down methods. Here is a short example demonstrating how Excel's sometimes unknown matrix…

Uncertainty based pressure reconstruction from velocity measurement with generalized least squares

NASA Astrophysics Data System (ADS)

Zhang, Jiacheng; Scalo, Carlo; Vlachos, Pavlos

2017-11-01

A method using generalized least squares reconstruction of instantaneous pressure field from velocity measurement and velocity uncertainty is introduced and applied to both planar and volumetric flow data. Pressure gradients are computed on a staggered grid from flow acceleration. The variance-covariance matrix of the pressure gradients is evaluated from the velocity uncertainty by approximating the pressure gradient error to a linear combination of velocity errors. An overdetermined system of linear equations which relates the pressure and the computed pressure gradients is formulated and then solved using generalized least squares with the variance-covariance matrix of the pressure gradients. By comparing the reconstructed pressure field against other methods such as solving the pressure Poisson equation, the omni-directional integration, and the ordinary least squares reconstruction, generalized least squares method is found to be more robust to the noise in velocity measurement. The improvement on pressure result becomes more remarkable when the velocity measurement becomes less accurate and more heteroscedastic. The uncertainty of the reconstructed pressure field is also quantified and compared across the different methods.

A mathematical model for simulating noise suppression of lined ejectors

NASA Technical Reports Server (NTRS)

Watson, Willie R.

1994-01-01

A mathematical model containing the essential features embodied in the noise suppression of lined ejectors is presented. Although some simplification of the physics is necessary to render the model mathematically tractable, the current model is the most versatile and technologically advanced at the current time. A system of linearized equations and the boundary conditions governing the sound field are derived starting from the equations of fluid dynamics. A nonreflecting boundary condition is developed. In view of the complex nature of the equations, a parametric study requires the use of numerical techniques and modern computers. A finite element algorithm that solves the differential equations coupled with the boundary condition is then introduced. The numerical method results in a matrix equation with several hundred thousand degrees of freedom that is solved efficiently on a supercomputer. The model is validated by comparing results either with exact solutions or with approximate solutions from other works. In each case, excellent correlations are obtained. The usefulness of the model as an optimization tool and the importance of variable impedance liners as a mechanism for achieving broadband suppression within a lined ejector are demonstrated.

Mass eigenstates in bimetric theory with matter coupling

DOE Office of Scientific and Technical Information (OSTI.GOV)

Schmidt-May, Angnis, E-mail: angnis.schmidt-may@fysik.su.se

2015-01-01

In this paper we study the ghost-free bimetric action extended by a recently proposed coupling to matter through a composite metric. The equations of motion for this theory are derived using a method which avoids varying the square-root matrix that appears in the matter coupling. We make an ansatz for which the metrics are proportional to each other and find that it can solve the equations provided that one parameter in the action is fixed. In this case, the proportional metrics as well as the effective metric that couples to matter solve Einstein's equations of general relativity including a mattermore » source. Around these backgrounds we derive the quadratic action for perturbations and diagonalize it into generalized mass eigenstates. It turns out that matter only interacts with the massless spin-2 mode whose equation of motion has exactly the form of the linearized Einstein equations, while the field with Fierz-Pauli mass term is completely decoupled. Hence, bimetric theory, with one parameter fixed such that proportional solutions exist, is degenerate with general relativity up to linear order around these backgrounds.« less

Reactive transport in fractured porous media

NASA Astrophysics Data System (ADS)

Adler, P.; Jasinski, L.; Thovert, J.-F.; Mourzenko, V. V.

2012-04-01

Reactive flow through geological formations occurs in many situations due to human intervention or during natural processes. For instance, chemical dissolution and precipitation play a major role in diagenesis or in the formation of karsts. The quantitative description of the injection of a reacting fluid from a well into a fractured porous medium is also a subject of high interest. It can be provoked, as in the acidization stimulation technique for increasing well productivity, or accidental, in CO2 sequestration. Ideally, one wishes to analyze the improvements or damages caused by the fluid to the well itself and to its immediate surroundings. To this end, a coupled system of equations has to be solved. It includes the description of the flow in the porous matrix and in the fracture network by Darcy-like equations, and the description of the reactive solute transport and of the reactions which occur in the two structures. In addition, constitutive equations are required for the evolution of these two structures, such as evolution laws for permeability and reactivity as functions of porosity. Our discrete fracture numerical model involves three major steps. First, an unstructured tetrahedral mesh of the fractures and of the porous matrix is built. Second, the Darcy equations are discretized and solved, in a finite volume formulation. Third, the evolution of the solute concentration has to be calculated. This is the most difficult point if one wants to avoid numerical diffusion and accurately describe the transfers between the fractures and the matrix. A non linear flux limiting scheme of the Superbee type coupled with a systematic use of triple control volumes proved to be the most efficient. Various simple model situations have been considered, for validation purposes or to illustrate some physical points. In particular, it is shown that even when the matrix permeability is small and the flow is predominantly carried by the fracture network, convective exchanges still exist between the fractures and the matrix which can widely exceed diffusive ones and strongly affect the solute transport and its residence time distribution. Finally, simulations of passive and reactive solute transport have been performed in large samples containing percolating or non percolating fracture networks. Various parameters have been systematically investigated, including the transmissivity of the fractures, the flow regime characterized by Péclet numbers in the fractures and in the matrix, and the Damköhler numbers of the reaction process in the matrix and fractures. The passive transport behavior and the effect of the gradual clogging of the fractures and/or matrix pore space in the case of a precipitation process are analyzed.

Reactive flow in fractured porous media

NASA Astrophysics Data System (ADS)

Jasinski, L.; Thovert, J.; Mourzenko, V.; Adler, P. M.

2011-12-01

Reactive flow through geological formations occurs in many situations due to human intervention or during natural processes. For instance, chemical dissolution and precipitation play a major role in diagenesis or in the formation of karsts. The quantitative description of the injection of a reacting fluid from a well into a fractured porous medium is also a subject of high interest. It can be provoked, as in the acidization stimulation technique for increasing well productivity, or accidental, in CO2 sequestration. Ideally, one wishes to analyze the improvements or damages caused by the fluid to the well itself and to its immediate surroundings. To this end, a coupled system of equations has to be solved. It includes the description of the flow in the porous matrix and in the fracture network by Darcy-like equations, and the description of the reactive solute transport and of the reactions which occur in the two structures. In addition, constitutive equations are required for the evolution of these two structures, such as evolution laws for permeability and reactivity as functions of porosity. Our discrete fracture numerical model involves three major steps. First, an unstructured tetrahedral mesh of the fractures and of the porous matrix is built. Second, the Darcy equations are discretized and solved, in a finite volume formulation. Third, the evolution of the solute concentration has to be calculated. This is the most difficult point if one wants to avoid numerical diffusion and accurately describe the transfers between the fractures and the matrix. A non linear flux limiting scheme of the Superbee type coupled with a systematic use of triple control volumes proved to be the most efficient. Various simple model situations have been considered, for validation purposes or to illustrate some physical points. In particular, it is shown that even when the matrix permeability is small and the flow is predominantly carried by the fracture network, convective exchanges still exist between the fractures and the matrix which can widely exceed diffusive ones and strongly affect the solute transport and its residence time distribution. Finally, simulations of passive and reactive solute transport have been performed in large samples containing percolating or non percolating fracture networks. Various parameters have been systematically investigated, including the transmissivity of the fractures, the flow regime characterized by Péclet numbers in the fractures and in the matrix, and the Damköhler numbers of the reaction process in the matrix and fractures. The passive transport behavior and the effect of the gradual clogging of the fractures and/or matrix pore space in the case of a precipitation process are analyzed.

Understanding fluid transport through the multiscale pore network of a natural shale

NASA Astrophysics Data System (ADS)

Davy, Catherine; Adler, Pierre; Song, Yang; Nguyen, Thang Kim; Troadec, David; Dhénin, Jean-Francois

2017-04-01

Natural shales have a complex pore structure, which is only partly understood today. In the present contribution, a combination of different techniques is used to get information on three different scales. On each scale, the relevant flow equation is solved and provides input for the flow equation of the next higher scale. More precisely, micro-CT, FIB/SEM (Focused Ion Beam/Scanning Electron Microscopy) and TEM (Transmission Electron Microscopy) provide a full representative 3D pore space on the macroscopic scale, the mesoscale and the nanoscale. The corresponding typical voxel sizes are 0.7 μm, 10 nm and 1 nm, respectively. The porosity on the micro-CT images is 0.5 %, and it is not connected. One can distinguish between the pores, the porous clay matrix and non porous minerals; the volume percentages of these last two phases are 0.6 and 0.395, respectively. Samples of the porous clay matrix were analyzed by FIB/SEM which yields 3D information. They have a porosity ranging from 2 to 6 %. In some of them, the pore space is connected. Finally, TEM provides 2D images with a porosity of about 10 to 25 %. These information were used in the following way to estimate the macroscopic permeability which has been measured independently and found equal to 6 x10-20 m2. At the nanoscopic scale analyzed by 2D TEM, in the absence of 3D images, the pore structure is reconstructed by using a technique based on truncated Gaussian fields. Then, the Stokes equations are solved by using a 3D Lattice Boltzmann method. The resulting velocity field is averaged and this provides the permeability K_n. The permeability of the nanoscale structure varies between 0.7x 10-20 and 1.8x10-19 m2. As expected, the material is anisotropic. At the mesoscale, percolation of the FIB/SEM pore volume occurs only along a single direction. The Stokes equations are again solved by the same method and the mesoscopic permeability Km varies between 3.3 10-20 and 1.20 10-18 m2, depending on the nature of the percolating volume. The influence of the nanoscale porosity on the mesoscopic permeability is also studied. Two examples show that despite the scale ratio between the mesoscopic and nanoscopic pores, the nanoscopic pore structure cannot be neglected to estimate the permeability of the pore clay matrix. Finally, the sample provided by micro-CT is considered as a porous medium composed of three phases with permeabilities 0 (for the non porous minerals), 1 (for the porous clay matrix) and infinity (for the macroscopic pores). The overall permeability Kmacro is obtained by solving the Darcy's equation with a variable local permeability with spatially periodic boundary conditions. Kmacro is found of the order of 0.4 and the medium is relatively isotropic on this scale. This estimation of Kmacro is in agreement with the measured value.

Representations of the quantum doubles of finite group algebras and spectral parameter dependent solutions of the Yang-Baxter equation

DOE Office of Scientific and Technical Information (OSTI.GOV)

Dancer, K. A.; Isac, P. S.; Links, J.

2006-10-15

Quantum doubles of finite group algebras form a class of quasitriangular Hopf algebras that algebraically solve the Yang-Baxter equation. Each representation of the quantum double then gives a matrix solution of the Yang-Baxter equation. Such solutions do not depend on a spectral parameter, and to date there has been little investigation into extending these solutions such that they do depend on a spectral parameter. Here we first explicitly construct the matrix elements of the generators for all irreducible representations of quantum doubles of the dihedral groups D{sub n}. These results may be used to determine constant solutions of the Yang-Baxtermore » equation. We then discuss Baxterization ansaetze to obtain solutions of the Yang-Baxter equation with a spectral parameter and give several examples, including a new 21-vertex model. We also describe this approach in terms of minimal-dimensional representations of the quantum doubles of the alternating group A{sub 4} and the symmetric group S{sub 4}.« less

Recursive partitioned inversion of large (1500 x 1500) symmetric matrices

NASA Technical Reports Server (NTRS)

Putney, B. H.; Brownd, J. E.; Gomez, R. A.

1976-01-01

A recursive algorithm was designed to invert large, dense, symmetric, positive definite matrices using small amounts of computer core, i.e., a small fraction of the core needed to store the complete matrix. The described algorithm is a generalized Gaussian elimination technique. Other algorithms are also discussed for the Cholesky decomposition and step inversion techniques. The purpose of the inversion algorithm is to solve large linear systems of normal equations generated by working geodetic problems. The algorithm was incorporated into a computer program called SOLVE. In the past the SOLVE program has been used in obtaining solutions published as the Goddard earth models.

Low-Rank Correction Methods for Algebraic Domain Decomposition Preconditioners

DOE PAGES

Li, Ruipeng; Saad, Yousef

2017-08-01

This study presents a parallel preconditioning method for distributed sparse linear systems, based on an approximate inverse of the original matrix, that adopts a general framework of distributed sparse matrices and exploits domain decomposition (DD) and low-rank corrections. The DD approach decouples the matrix and, once inverted, a low-rank approximation is applied by exploiting the Sherman--Morrison--Woodbury formula, which yields two variants of the preconditioning methods. The low-rank expansion is computed by the Lanczos procedure with reorthogonalizations. Numerical experiments indicate that, when combined with Krylov subspace accelerators, this preconditioner can be efficient and robust for solving symmetric sparse linear systems. Comparisonsmore » with pARMS, a DD-based parallel incomplete LU (ILU) preconditioning method, are presented for solving Poisson's equation and linear elasticity problems.« less

Low-Rank Correction Methods for Algebraic Domain Decomposition Preconditioners

DOE Office of Scientific and Technical Information (OSTI.GOV)

Li, Ruipeng; Saad, Yousef

This study presents a parallel preconditioning method for distributed sparse linear systems, based on an approximate inverse of the original matrix, that adopts a general framework of distributed sparse matrices and exploits domain decomposition (DD) and low-rank corrections. The DD approach decouples the matrix and, once inverted, a low-rank approximation is applied by exploiting the Sherman--Morrison--Woodbury formula, which yields two variants of the preconditioning methods. The low-rank expansion is computed by the Lanczos procedure with reorthogonalizations. Numerical experiments indicate that, when combined with Krylov subspace accelerators, this preconditioner can be efficient and robust for solving symmetric sparse linear systems. Comparisonsmore » with pARMS, a DD-based parallel incomplete LU (ILU) preconditioning method, are presented for solving Poisson's equation and linear elasticity problems.« less

On the relationship between the classical Dicke-Jaynes-Cummings-Gaudin model and the nonlinear Schroedinger equation

DOE Office of Scientific and Technical Information (OSTI.GOV)

Du, Dianlou; Geng, Xue

2013-05-15

In this paper, the relationship between the classical Dicke-Jaynes-Cummings-Gaudin (DJCG) model and the nonlinear Schroedinger (NLS) equation is studied. It is shown that the classical DJCG model is equivalent to a stationary NLS equation. Moreover, the standard NLS equation can be solved by the classical DJCG model and a suitably chosen higher order flow. Further, it is also shown that classical DJCG model can be transformed into the classical Gaudin spin model in an external magnetic field through a deformation of Lax matrix. Finally, the separated variables are constructed on the common level sets of Casimir functions and the generalizedmore » action-angle coordinates are introduced via the Hamilton-Jacobi equation.« less

Fem Formulation of Heat Transfer in Cylindrical Porous Medium

NASA Astrophysics Data System (ADS)

Azeem; Khaleed, H. M. T.; Soudagar, Manzoor Elahi M.

2017-08-01

Heat transfer in porous medium can be derived from the fundamental laws of flow in porous region ass given by Henry Darcy. The fluid flow and energy transport inside the porous medium can be described with the help of momentum and energy equations. The heat transfer in cylindrical porous medium differs from its counterpart in radial and axial coordinates. The present work is focused to discuss the finite element formulation of heat transfer in cylindrical porous medium. The basic partial differential equations are derived using Darcy law which is the converted into a set of algebraic equations with the help of finite element method. The resulting equations are solved by matrix method for two solution variables involved in the coupled equations.

FDM study of ion exchange diffusion equation in glass

NASA Astrophysics Data System (ADS)

Zhou, Zigang; Yang, Yongjia; Wang, Qiang; Sun, Guangchun

2009-05-01

Ion-exchange technique in glass was developed to fabricate gradient refractive index optical devices. In this paper, the Finite Difference Method(FDM), which is used for the solution of ion-diffusion equation, is reported. This method transforms continual diffusion equation to separate difference equation. It unitizes the matrix of MATLAB program to solve the iteration process. The collation results under square boundary condition show that it gets a more accurate numerical solution. Compared to experiment data, the relative error is less than 0.2%. Furthermore, it has simply operation and kinds of output solutions. This method can provide better results for border-proliferation of the hexagonal and the channel devices too.

Vector solution for the mean electromagnetic fields in a layer of random particles

NASA Technical Reports Server (NTRS)

Lang, R. H.; Seker, S. S.; Levine, D. M.

1986-01-01

The mean electromagnetic fields are found in a layer of randomly oriented particles lying over a half space. A matrix-dyadic formulation of Maxwell's equations is employed in conjunction with the Foldy-Lax approximation to obtain equations for the mean fields. A two variable perturbation procedure, valid in the limit of small fractional volume, is then used to derive uncoupled equations for the slowly varying amplitudes of the mean wave. These equations are solved to obtain explicit expressions for the mean electromagnetic fields in the slab region in the general case of arbitrarily oriented particles and arbitrary polarization of the incident radiation. Numerical examples are given for the application to remote sensing of vegetation.

Numerical solutions to the time-dependent Bloch equations revisited.

PubMed

Murase, Kenya; Tanki, Nobuyoshi

2011-01-01

The purpose of this study was to demonstrate a simple and fast method for solving the time-dependent Bloch equations. First, the time-dependent Bloch equations were reduced to a homogeneous linear differential equation, and then a simple equation was derived to solve it using a matrix operation. The validity of this method was investigated by comparing with the analytical solutions in the case of constant radiofrequency irradiation. There was a good agreement between them, indicating the validity of this method. As a further example, this method was applied to the time-dependent Bloch equations in the two-pool exchange model for chemical exchange saturation transfer (CEST) or amide proton transfer (APT) magnetic resonance imaging (MRI), and the Z-spectra and asymmetry spectra were calculated from their solutions. They were also calculated using the fourth/fifth-order Runge-Kutta-Fehlberg (RKF) method for comparison. There was also a good agreement between them, and this method was much faster than the RKF method. In conclusion, this method will be useful for analyzing the complex CEST or APT contrast mechanism and/or investigating the optimal conditions for CEST or APT MRI. Copyright © 2011 Elsevier Inc. All rights reserved.

Simulation electromagnetic scattering on bodies through integral equation and neural networks methods

NASA Astrophysics Data System (ADS)

Lvovich, I. Ya; Preobrazhenskiy, A. P.; Choporov, O. N.

2018-05-01

The paper deals with the issue of electromagnetic scattering on a perfectly conducting diffractive body of a complex shape. Performance calculation of the body scattering is carried out through the integral equation method. Fredholm equation of the second time was used for calculating electric current density. While solving the integral equation through the moments method, the authors have properly described the core singularity. The authors determined piecewise constant functions as basic functions. The chosen equation was solved through the moments method. Within the Kirchhoff integral approach it is possible to define the scattered electromagnetic field, in some way related to obtained electrical currents. The observation angles sector belongs to the area of the front hemisphere of the diffractive body. To improve characteristics of the diffractive body, the authors used a neural network. All the neurons contained a logsigmoid activation function and weighted sums as discriminant functions. The paper presents the matrix of weighting factors of the connectionist model, as well as the results of the optimized dimensions of the diffractive body. The paper also presents some basic steps in calculation technique of the diffractive bodies, based on the combination of integral equation and neural networks methods.

Exact Dynamics via Poisson Process: a unifying Monte Carlo paradigm

NASA Astrophysics Data System (ADS)

Gubernatis, James

2014-03-01

A common computational task is solving a set of ordinary differential equations (o.d.e.'s). A little known theorem says that the solution of any set of o.d.e.'s is exactly solved by the expectation value over a set of arbitary Poisson processes of a particular function of the elements of the matrix that defines the o.d.e.'s. The theorem thus provides a new starting point to develop real and imaginary-time continous-time solvers for quantum Monte Carlo algorithms, and several simple observations enable various quantum Monte Carlo techniques and variance reduction methods to transfer to a new context. I will state the theorem, note a transformation to a very simple computational scheme, and illustrate the use of some techniques from the directed-loop algorithm in context of the wavefunction Monte Carlo method that is used to solve the Lindblad master equation for the dynamics of open quantum systems. I will end by noting that as the theorem does not depend on the source of the o.d.e.'s coming from quantum mechanics, it also enables the transfer of continuous-time methods from quantum Monte Carlo to the simulation of various classical equations of motion heretofore only solved deterministically.

AITRAC: Augmented Interactive Transient Radiation Analysis by Computer. User's information manual

DOE Office of Scientific and Technical Information (OSTI.GOV)

Not Available

1977-10-01

AITRAC is a program designed for on-line, interactive, DC, and transient analysis of electronic circuits. The program solves linear and nonlinear simultaneous equations which characterize the mathematical models used to predict circuit response. The program features 100 external node--200 branch capability; conversional, free-format input language; built-in junction, FET, MOS, and switch models; sparse matrix algorithm with extended-precision H matrix and T vector calculations, for fast and accurate execution; linear transconductances: beta, GM, MU, ZM; accurate and fast radiation effects analysis; special interface for user-defined equations; selective control of multiple outputs; graphical outputs in wide and narrow formats; and on-line parametermore » modification capability. The user describes the problem by entering the circuit topology and part parameters. The program then automatically generates and solves the circuit equations, providing the user with printed or plotted output. The circuit topology and/or part values may then be changed by the user, and a new analysis, requested. Circuit descriptions may be saved on disk files for storage and later use. The program contains built-in standard models for resistors, voltage and current sources, capacitors, inductors including mutual couplings, switches, junction diodes and transistors, FETS, and MOS devices. Nonstandard models may be constructed from standard models or by using the special equations interface. Time functions may be described by straight-line segments or by sine, damped sine, and exponential functions. 42 figures, 1 table. (RWR)« less

Quantum mechanical generalized phase-shift approach to atom-surface scattering: a Feshbach projection approach to dealing with closed channel effects.

PubMed

Maji, Kaushik; Kouri, Donald J

2011-03-28

We have developed a new method for solving quantum dynamical scattering problems, using the time-independent Schrödinger equation (TISE), based on a novel method to generalize a "one-way" quantum mechanical wave equation, impose correct boundary conditions, and eliminate exponentially growing closed channel solutions. The approach is readily parallelized to achieve approximate N(2) scaling, where N is the number of coupled equations. The full two-way nature of the TISE is included while propagating the wave function in the scattering variable and the full S-matrix is obtained. The new algorithm is based on a "Modified Cayley" operator splitting approach, generalizing earlier work where the method was applied to the time-dependent Schrödinger equation. All scattering variable propagation approaches to solving the TISE involve solving a Helmholtz-type equation, and for more than one degree of freedom, these are notoriously ill-behaved, due to the unavoidable presence of exponentially growing contributions to the numerical solution. Traditionally, the method used to eliminate exponential growth has posed a major obstacle to the full parallelization of such propagation algorithms. We stabilize by using the Feshbach projection operator technique to remove all the nonphysical exponentially growing closed channels, while retaining all of the propagating open channel components, as well as exponentially decaying closed channel components.

Scalable direct Vlasov solver with discontinuous Galerkin method on unstructured mesh.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Xu, J.; Ostroumov, P. N.; Mustapha, B.

2010-12-01

This paper presents the development of parallel direct Vlasov solvers with discontinuous Galerkin (DG) method for beam and plasma simulations in four dimensions. Both physical and velocity spaces are in two dimesions (2P2V) with unstructured mesh. Contrary to the standard particle-in-cell (PIC) approach for kinetic space plasma simulations, i.e., solving Vlasov-Maxwell equations, direct method has been used in this paper. There are several benefits to solving a Vlasov equation directly, such as avoiding noise associated with a finite number of particles and the capability to capture fine structure in the plasma. The most challanging part of a direct Vlasov solvermore » comes from higher dimensions, as the computational cost increases as N{sup 2d}, where d is the dimension of the physical space. Recently, due to the fast development of supercomputers, the possibility has become more realistic. Many efforts have been made to solve Vlasov equations in low dimensions before; now more interest has focused on higher dimensions. Different numerical methods have been tried so far, such as the finite difference method, Fourier Spectral method, finite volume method, and spectral element method. This paper is based on our previous efforts to use the DG method. The DG method has been proven to be very successful in solving Maxwell equations, and this paper is our first effort in applying the DG method to Vlasov equations. DG has shown several advantages, such as local mass matrix, strong stability, and easy parallelization. These are particularly suitable for Vlasov equations. Domain decomposition in high dimensions has been used for parallelization; these include a highly scalable parallel two-dimensional Poisson solver. Benchmark results have been shown and simulation results will be reported.« less

Study of flutter related computational procedures for minimum weight structural sizing of advanced aircraft, supplemental data

NASA Technical Reports Server (NTRS)

Oconnell, R. F.; Hassig, H. J.; Radovcich, N. A.

1975-01-01

Computational aspects of (1) flutter optimization (minimization of structural mass subject to specified flutter requirements), (2) methods for solving the flutter equation, and (3) efficient methods for computing generalized aerodynamic force coefficients in the repetitive analysis environment of computer-aided structural design are discussed. Specific areas included: a two-dimensional Regula Falsi approach to solving the generalized flutter equation; method of incremented flutter analysis and its applications; the use of velocity potential influence coefficients in a five-matrix product formulation of the generalized aerodynamic force coefficients; options for computational operations required to generate generalized aerodynamic force coefficients; theoretical considerations related to optimization with one or more flutter constraints; and expressions for derivatives of flutter-related quantities with respect to design variables.

A BiCGStab2 variant of the IDR(s) method for solving linear equations

NASA Astrophysics Data System (ADS)

Abe, Kuniyoshi; Sleijpen, Gerard L. G.

2012-09-01

The hybrid Bi-Conjugate Gradient (Bi-CG) methods, such as the BiCG STABilized (BiCGSTAB), BiCGstab(l), BiCGStab2 and BiCG×MR2 methods are well-known solvers for solving a linear equation with a nonsymmetric matrix. The Induced Dimension Reduction (IDR)(s) method has recently been proposed, and it has been reported that IDR(s) is often more effective than the hybrid BiCG methods. IDR(s) combining the stabilization polynomial of BiCGstab(l) has been designed to improve the convergence of the original IDR(s) method. We therefore propose IDR(s) combining the stabilization polynomial of BiCGStab2. Numerical experiments show that our proposed variant of IDR(s) is more effective than the original IDR(s) and BiCGStab2 methods.

A SEMI-LAGRANGIAN TWO-LEVEL PRECONDITIONED NEWTON-KRYLOV SOLVER FOR CONSTRAINED DIFFEOMORPHIC IMAGE REGISTRATION.

PubMed

Mang, Andreas; Biros, George

2017-01-01

We propose an efficient numerical algorithm for the solution of diffeomorphic image registration problems. We use a variational formulation constrained by a partial differential equation (PDE), where the constraints are a scalar transport equation. We use a pseudospectral discretization in space and second-order accurate semi-Lagrangian time stepping scheme for the transport equations. We solve for a stationary velocity field using a preconditioned, globalized, matrix-free Newton-Krylov scheme. We propose and test a two-level Hessian preconditioner. We consider two strategies for inverting the preconditioner on the coarse grid: a nested preconditioned conjugate gradient method (exact solve) and a nested Chebyshev iterative method (inexact solve) with a fixed number of iterations. We test the performance of our solver in different synthetic and real-world two-dimensional application scenarios. We study grid convergence and computational efficiency of our new scheme. We compare the performance of our solver against our initial implementation that uses the same spatial discretization but a standard, explicit, second-order Runge-Kutta scheme for the numerical time integration of the transport equations and a single-level preconditioner. Our improved scheme delivers significant speedups over our original implementation. As a highlight, we observe a 20 × speedup for a two dimensional, real world multi-subject medical image registration problem.

Matrix method for two-dimensional waveguide mode solution

NASA Astrophysics Data System (ADS)

Sun, Baoguang; Cai, Congzhong; Venkatesh, Balajee Seshasayee

2018-05-01

In this paper, we show that the transfer matrix theory of multilayer optics can be used to solve the modes of any two-dimensional (2D) waveguide for their effective indices and field distributions. A 2D waveguide, even composed of numerous layers, is essentially a multilayer stack and the transmission through the stack can be analysed using the transfer matrix theory. The result is a transfer matrix with four complex value elements, namely A, B, C and D. The effective index of a guided mode satisfies two conditions: (1) evanescent waves exist simultaneously in the first (cladding) layer and last (substrate) layer, and (2) the complex element D vanishes. For a given mode, the field distribution in the waveguide is the result of a 'folded' plane wave. In each layer, there is only propagation and absorption; at each boundary, only reflection and refraction occur, which can be calculated according to the Fresnel equations. As examples, we show that this method can be used to solve modes supported by the multilayer step-index dielectric waveguide, slot waveguide, gradient-index waveguide and various plasmonic waveguides. The results indicate the transfer matrix method is effective for 2D waveguide mode solution in general.

Iterative color-multiplexed, electro-optical processor.

PubMed

Psaltis, D; Casasent, D; Carlotto, M

1979-11-01

A noncoherent optical vector-matrix multiplier using a linear LED source array and a linear P-I-N photodiode detector array has been combined with a 1-D adder in a feedback loop. The resultant iterative optical processor and its use in solving simultaneous linear equations are described. Operation on complex data is provided by a novel color-multiplexing system.

Coupled Modeling of Hydrodynamics and Sound in Coastal Ocean for Renewable Ocean Energy Development

DOE Office of Scientific and Technical Information (OSTI.GOV)

Long, Wen; Jung, Ki Won; Yang, Zhaoqing

An underwater sound model was developed to simulate sound propagation from marine and hydrokinetic energy (MHK) devices or offshore wind (OSW) energy platforms. Finite difference methods were developed to solve the 3D Helmholtz equation for sound propagation in the coastal environment. A 3D sparse matrix solver with complex coefficients was formed for solving the resulting acoustic pressure field. The Complex Shifted Laplacian Preconditioner (CSLP) method was applied to solve the matrix system iteratively with MPI parallelization using a high performance cluster. The sound model was then coupled with the Finite Volume Community Ocean Model (FVCOM) for simulating sound propagation generatedmore » by human activities, such as construction of OSW turbines or tidal stream turbine operations, in a range-dependent setting. As a proof of concept, initial validation of the solver is presented for two coastal wedge problems. This sound model can be useful for evaluating impacts on marine mammals due to deployment of MHK devices and OSW energy platforms.« less

MOM3D method of moments code theory manual

NASA Technical Reports Server (NTRS)

Shaeffer, John F.

1992-01-01

MOM3D is a FORTRAN algorithm that solves Maxwell's equations as expressed via the electric field integral equation for the electromagnetic response of open or closed three dimensional surfaces modeled with triangle patches. Two joined triangles (couples) form the vector current unknowns for the surface. Boundary conditions are for perfectly conducting or resistive surfaces. The impedance matrix represents the fundamental electromagnetic interaction of the body with itself. A variety of electromagnetic analysis options are possible once the impedance matrix is computed including backscatter radar cross section (RCS), bistatic RCS, antenna pattern prediction for user specified body voltage excitation ports, RCS image projection showing RCS scattering center locations, surface currents excited on the body as induced by specified plane wave excitation, and near field computation for the electric field on or near the body.

Fractal Model of Fission Product Release in Nuclear Fuel

NASA Astrophysics Data System (ADS)

Stankunas, Gediminas

2012-09-01

A model of fission gas migration in nuclear fuel pellet is proposed. Diffusion process of fission gas in granular structure of nuclear fuel with presence of inter-granular bubbles in the fuel matrix is simulated by fractional diffusion model. The Grunwald-Letnikov derivative parameter characterizes the influence of porous fuel matrix on the diffusion process of fission gas. A finite-difference method for solving fractional diffusion equations is considered. Numerical solution of diffusion equation shows correlation of fission gas release and Grunwald-Letnikov derivative parameter. Calculated profile of fission gas concentration distribution is similar to that obtained in the experimental studies. Diffusion of fission gas is modeled for real RBMK-1500 fuel operation conditions. A functional dependence of Grunwald-Letnikov derivative parameter with fuel burn-up is established.

Concerning an application of the method of least squares with a variable weight matrix

NASA Technical Reports Server (NTRS)

Sukhanov, A. A.

1979-01-01

An estimate of a state vector for a physical system when the weight matrix in the method of least squares is a function of this vector is considered. An iterative procedure is proposed for calculating the desired estimate. Conditions for the existence and uniqueness of the limit of this procedure are obtained, and a domain is found which contains the limit estimate. A second method for calculating the desired estimate which reduces to the solution of a system of algebraic equations is proposed. The question of applying Newton's method of tangents to solving the given system of algebraic equations is considered and conditions for the convergence of the modified Newton's method are obtained. Certain properties of the estimate obtained are presented together with an example.

The critical boundary RSOS M(3,5) model

NASA Astrophysics Data System (ADS)

El Deeb, O.

2017-12-01

We consider the critical nonunitary minimal model M(3, 5) with integrable boundaries and analyze the patterns of zeros of the eigenvalues of the transfer matrix and then determine the spectrum of the critical theory using the thermodynamic Bethe ansatz ( TBA) equations. Solving the TBA functional equation satisfied by the transfer matrices of the associated A 4 restricted solid-on-solid Forrester-Baxter lattice model in regime III in the continuum scaling limit, we derive the integral TBA equations for all excitations in the ( r, s) = (1, 1) sector and then determine their corresponding energies. We classify the excitations in terms of ( m, n) systems.

Distributed Relaxation Multigrid and Defect Correction Applied to the Compressible Navier-Stokes Equations

NASA Technical Reports Server (NTRS)

Thomas, J. L.; Diskin, B.; Brandt, A.

1999-01-01

The distributed-relaxation multigrid and defect- correction methods are applied to the two- dimensional compressible Navier-Stokes equations. The formulation is intended for high Reynolds number applications and several applications are made at a laminar Reynolds number of 10,000. A staggered- grid arrangement of variables is used; the coupled pressure and internal energy equations are solved together with multigrid, requiring a block 2x2 matrix solution. Textbook multigrid efficiencies are attained for incompressible and slightly compressible simulations of the boundary layer on a flat plate. Textbook efficiencies are obtained for compressible simulations up to Mach numbers of 0.7 for a viscous wake simulation.

Nonlinear integral equations for the sausage model

NASA Astrophysics Data System (ADS)

Ahn, Changrim; Balog, Janos; Ravanini, Francesco

2017-08-01

The sausage model, first proposed by Fateev, Onofri, and Zamolodchikov, is a deformation of the O(3) sigma model preserving integrability. The target space is deformed from the sphere to ‘sausage’ shape by a deformation parameter ν. This model is defined by a factorizable S-matrix which is obtained by deforming that of the O(3) sigma model by a parameter λ. Clues for the deformed sigma model are provided by various UV and IR information through the thermodynamic Bethe ansatz (TBA) analysis based on the S-matrix. Application of TBA to the sausage model is, however, limited to the case of 1/λ integer where the coupled integral equations can be truncated to a finite number. In this paper, we propose a finite set of nonlinear integral equations (NLIEs), which are applicable to generic value of λ. Our derivation is based on T-Q relations extracted from the truncated TBA equations. For a consistency check, we compute next-leading order corrections of the vacuum energy and extract the S-matrix information in the IR limit. We also solved the NLIE both analytically and numerically in the UV limit to get the effective central charge and compared with that of the zero-mode dynamics to obtain exact relation between ν and λ. Dedicated to the memory of Petr Petrovich Kulish.

Quantum groups, Yang-Baxter maps and quasi-determinants

NASA Astrophysics Data System (ADS)

Tsuboi, Zengo

2018-01-01

For any quasi-triangular Hopf algebra, there exists the universal R-matrix, which satisfies the Yang-Baxter equation. It is known that the adjoint action of the universal R-matrix on the elements of the tensor square of the algebra constitutes a quantum Yang-Baxter map, which satisfies the set-theoretic Yang-Baxter equation. The map has a zero curvature representation among L-operators defined as images of the universal R-matrix. We find that the zero curvature representation can be solved by the Gauss decomposition of a product of L-operators. Thereby obtained a quasi-determinant expression of the quantum Yang-Baxter map associated with the quantum algebra Uq (gl (n)). Moreover, the map is identified with products of quasi-Plücker coordinates over a matrix composed of the L-operators. We also consider the quasi-classical limit, where the underlying quantum algebra reduces to a Poisson algebra. The quasi-determinant expression of the quantum Yang-Baxter map reduces to ratios of determinants, which give a new expression of a classical Yang-Baxter map.

Damping mathematical modelling and dynamic responses for FRP laminated composite plates with polymer matrix

NASA Astrophysics Data System (ADS)

Liu, Qimao

2018-02-01

This paper proposes an assumption that the fibre is elastic material and polymer matrix is viscoelastic material so that the energy dissipation depends only on the polymer matrix in dynamic response process. The damping force vectors in frequency and time domains, of FRP (Fibre-Reinforced Polymer matrix) laminated composite plates, are derived based on this assumption. The governing equations of FRP laminated composite plates are formulated in both frequency and time domains. The direct inversion method and direct time integration method for nonviscously damped systems are employed to solve the governing equations and achieve the dynamic responses in frequency and time domains, respectively. The computational procedure is given in detail. Finally, dynamic responses (frequency responses with nonzero and zero initial conditions, free vibration, forced vibrations with nonzero and zero initial conditions) of a FRP laminated composite plate are computed using the proposed methodology. The proposed methodology in this paper is easy to be inserted into the commercial finite element analysis software. The proposed assumption, based on the theory of material mechanics, needs to be further proved by experiment technique in the future.

Development of iterative techniques for the solution of unsteady compressible viscous flows

NASA Technical Reports Server (NTRS)

Sankar, Lakshmi N.; Hixon, Duane

1991-01-01

Efficient iterative solution methods are being developed for the numerical solution of two- and three-dimensional compressible Navier-Stokes equations. Iterative time marching methods have several advantages over classical multi-step explicit time marching schemes, and non-iterative implicit time marching schemes. Iterative schemes have better stability characteristics than non-iterative explicit and implicit schemes. Thus, the extra work required by iterative schemes can also be designed to perform efficiently on current and future generation scalable, missively parallel machines. An obvious candidate for iteratively solving the system of coupled nonlinear algebraic equations arising in CFD applications is the Newton method. Newton's method was implemented in existing finite difference and finite volume methods. Depending on the complexity of the problem, the number of Newton iterations needed per step to solve the discretized system of equations can, however, vary dramatically from a few to several hundred. Another popular approach based on the classical conjugate gradient method, known as the GMRES (Generalized Minimum Residual) algorithm is investigated. The GMRES algorithm was used in the past by a number of researchers for solving steady viscous and inviscid flow problems with considerable success. Here, the suitability of this algorithm is investigated for solving the system of nonlinear equations that arise in unsteady Navier-Stokes solvers at each time step. Unlike the Newton method which attempts to drive the error in the solution at each and every node down to zero, the GMRES algorithm only seeks to minimize the L2 norm of the error. In the GMRES algorithm the changes in the flow properties from one time step to the next are assumed to be the sum of a set of orthogonal vectors. By choosing the number of vectors to a reasonably small value N (between 5 and 20) the work required for advancing the solution from one time step to the next may be kept to (N+1) times that of a noniterative scheme. Many of the operations required by the GMRES algorithm such as matrix-vector multiplies, matrix additions and subtractions can all be vectorized and parallelized efficiently.

Close range fault tolerant noncontacting position sensor

DOEpatents

Bingham, D.N.; Anderson, A.A.

1996-02-20

A method and system are disclosed for locating the three dimensional coordinates of a moving or stationary object in real time. The three dimensional coordinates of an object in half space or full space are determined based upon the time of arrival or phase of the wave front measured by a plurality of receiver elements and an established vector magnitudes proportional to the measured time of arrival or phase at each receiver element. The coordinates of the object are calculated by solving a matrix equation or a set of closed form algebraic equations. 3 figs.

Fast solution of elliptic partial differential equations using linear combinations of plane waves.

PubMed

Pérez-Jordá, José M

2016-02-01

Given an arbitrary elliptic partial differential equation (PDE), a procedure for obtaining its solution is proposed based on the method of Ritz: the solution is written as a linear combination of plane waves and the coefficients are obtained by variational minimization. The PDE to be solved is cast as a system of linear equations Ax=b, where the matrix A is not sparse, which prevents the straightforward application of standard iterative methods in order to solve it. This sparseness problem can be circumvented by means of a recursive bisection approach based on the fast Fourier transform, which makes it possible to implement fast versions of some stationary iterative methods (such as Gauss-Seidel) consuming O(NlogN) memory and executing an iteration in O(Nlog(2)N) time, N being the number of plane waves used. In a similar way, fast versions of Krylov subspace methods and multigrid methods can also be implemented. These procedures are tested on Poisson's equation expressed in adaptive coordinates. It is found that the best results are obtained with the GMRES method using a multigrid preconditioner with Gauss-Seidel relaxation steps.

The program LOPT for least-squares optimization of energy levels

NASA Astrophysics Data System (ADS)

Kramida, A. E.

2011-02-01

The article describes a program that solves the least-squares optimization problem for finding the energy levels of a quantum-mechanical system based on a set of measured energy separations or wavelengths of transitions between those energy levels, as well as determining the Ritz wavelengths of transitions and their uncertainties. The energy levels are determined by solving the matrix equation of the problem, and the uncertainties of the Ritz wavenumbers are determined from the covariance matrix of the problem. Program summaryProgram title: LOPT Catalogue identifier: AEHM_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEHM_v1_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.html No. of lines in distributed program, including test data, etc.: 19 254 No. of bytes in distributed program, including test data, etc.: 427 839 Distribution format: tar.gz Programming language: Perl v.5 Computer: PC, Mac, Unix workstations Operating system: MS Windows (XP, Vista, 7), Mac OS X, Linux, Unix (AIX) RAM: 3 Mwords or more Word size: 32 or 64 Classification: 2.2 Nature of problem: The least-squares energy-level optimization problem, i.e., finding a set of energy level values that best fits the given set of transition intervals. Solution method: The solution of the least-squares problem is found by solving the corresponding linear matrix equation, where the matrix is constructed using a new method with variable substitution. Restrictions: A practical limitation on the size of the problem N is imposed by the execution time, which scales as N and depends on the computer. Unusual features: Properly rounds the resulting data and formats the output in a format suitable for viewing with spreadsheet editing software. Estimates numerical errors resulting from the limited machine precision. Running time: 1 s for N=100, or 60 s for N=400 on a typical PC.

New displacement-based methods for optimal truss topology design

NASA Technical Reports Server (NTRS)

Bendsoe, Martin P.; Ben-Tal, Aharon; Haftka, Raphael T.

1991-01-01

Two alternate methods for maximum stiffness truss topology design are presented. The ground structure approach is used, and the problem is formulated in terms of displacements and bar areas. This large, nonconvex optimization problem can be solved by a simultaneous analysis and design approach. Alternatively, an equivalent, unconstrained, and convex problem in the displacements only can be formulated, and this problem can be solved by a nonsmooth, steepest descent algorithm. In both methods, the explicit solving of the equilibrium equations and the assembly of the global stiffness matrix are circumvented. A large number of examples have been studied, showing the attractive features of topology design as well as exposing interesting features of optimal topologies.

An efficient three-dimensional Poisson solver for SIMD high-performance-computing architectures

NASA Technical Reports Server (NTRS)

Cohl, H.

1994-01-01

We present an algorithm that solves the three-dimensional Poisson equation on a cylindrical grid. The technique uses a finite-difference scheme with operator splitting. This splitting maps the banded structure of the operator matrix into a two-dimensional set of tridiagonal matrices, which are then solved in parallel. Our algorithm couples FFT techniques with the well-known ADI (Alternating Direction Implicit) method for solving Elliptic PDE's, and the implementation is extremely well suited for a massively parallel environment like the SIMD architecture of the MasPar MP-1. Due to the highly recursive nature of our problem, we believe that our method is highly efficient, as it avoids excessive interprocessor communication.

Mathematical Analysis of Vehicle Delivery Scale of Bike-Sharing Rental Nodes

NASA Astrophysics Data System (ADS)

Zhai, Y.; Liu, J.; Liu, L.

2018-04-01

Aiming at the lack of scientific and reasonable judgment of vehicles delivery scale and insufficient optimization of scheduling decision, based on features of the bike-sharing usage, this paper analyses the applicability of the discrete time and state of the Markov chain, and proves its properties to be irreducible, aperiodic and positive recurrent. Based on above analysis, the paper has reached to the conclusion that limit state (steady state) probability of the bike-sharing Markov chain only exists and is independent of the initial probability distribution. Then this paper analyses the difficulty of the transition probability matrix parameter statistics and the linear equations group solution in the traditional solving algorithm of the bike-sharing Markov chain. In order to improve the feasibility, this paper proposes a "virtual two-node vehicle scale solution" algorithm which considered the all the nodes beside the node to be solved as a virtual node, offered the transition probability matrix, steady state linear equations group and the computational methods related to the steady state scale, steady state arrival time and scheduling decision of the node to be solved. Finally, the paper evaluates the rationality and accuracy of the steady state probability of the proposed algorithm by comparing with the traditional algorithm. By solving the steady state scale of the nodes one by one, the proposed algorithm is proved to have strong feasibility because it lowers the level of computational difficulty and reduces the number of statistic, which will help the bike-sharing companies to optimize the scale and scheduling of nodes.

Effect of partial heating at mid of vertical plate adjacent to porous medium

NASA Astrophysics Data System (ADS)

Mulla, Mohammed Fahimuddin; Pallan, Khalid. M.; Al-Rashed, A. A. A. A.

2018-05-01

Heat and mass transfer in porous medium due to heating of vertical plate at mid-section is analyzed for various physical parameters. The heat and mass transfer in porous medium is modeled with the help of momentum, energy and concentration equations in terms of non-dimensional partial differential equations. The partial differential equations are converted into simpler form of algebraic equations with the help of finite element method. A computer code is developed to assemble the matrix form of algebraic equations into global matrices and then to solve them in an iterative manner to obtain the temperature, concentration and streamline distribution inside the porous medium. It is found that the heat transfer behavior of porous medium heated at middle section is considerably different from other cases.

A zonally symmetric model for the monsoon-Hadley circulation with stochastic convective forcing

NASA Astrophysics Data System (ADS)

De La Chevrotière, Michèle; Khouider, Boualem

2017-02-01

Idealized models of reduced complexity are important tools to understand key processes underlying a complex system. In climate science in particular, they are important for helping the community improve our ability to predict the effect of climate change on the earth system. Climate models are large computer codes based on the discretization of the fluid dynamics equations on grids of horizontal resolution in the order of 100 km, whereas unresolved processes are handled by subgrid models. For instance, simple models are routinely used to help understand the interactions between small-scale processes due to atmospheric moist convection and large-scale circulation patterns. Here, a zonally symmetric model for the monsoon circulation is presented and solved numerically. The model is based on the Galerkin projection of the primitive equations of atmospheric synoptic dynamics onto the first modes of vertical structure to represent free tropospheric circulation and is coupled to a bulk atmospheric boundary layer (ABL) model. The model carries bulk equations for water vapor in both the free troposphere and the ABL, while the processes of convection and precipitation are represented through a stochastic model for clouds. The model equations are coupled through advective nonlinearities, and the resulting system is not conservative and not necessarily hyperbolic. This makes the design of a numerical method for the solution of this system particularly difficult. Here, we develop a numerical scheme based on the operator time-splitting strategy, which decomposes the system into three pieces: a conservative part and two purely advective parts, each of which is solved iteratively using an appropriate method. The conservative system is solved via a central scheme, which does not require hyperbolicity since it avoids the Riemann problem by design. One of the advective parts is a hyperbolic diagonal matrix, which is easily handled by classical methods for hyperbolic equations, while the other advective part is a nilpotent matrix, which is solved via the method of lines. Validation tests using a synthetic exact solution are presented, and formal second-order convergence under grid refinement is demonstrated. Moreover, the model is tested under realistic monsoon conditions, and the ability of the model to simulate key features of the monsoon circulation is illustrated in two distinct parameter regimes.

Solution of the three-dimensional Helmholtz equation with nonlocal boundary conditions

NASA Technical Reports Server (NTRS)

Hodge, Steve L.; Zorumski, William E.; Watson, Willie R.

1995-01-01

The Helmholtz equation is solved within a three-dimensional rectangular duct with a nonlocal radiation boundary condition at the duct exit plane. This condition accurately models the acoustic admittance at an arbitrarily-located computational boundary plane. A linear system of equations is constructed with second-order central differences for the Helmholtz operator and second-order backward differences for both local admittance conditions and the gradient term in the nonlocal radiation boundary condition. The resulting matrix equation is large, sparse, and non-Hermitian. The size and structure of the matrix makes direct solution techniques impractical; as a result, a nonstationary iterative technique is used for its solution. The theory behind the nonstationary technique is reviewed, and numerical results are presented for radiation from both a point source and a planar acoustic source. The solutions with the nonlocal boundary conditions are invariant to the location of the computational boundary, and the same nonlocal conditions are valid for all solutions. The nonlocal conditions thus provide a means of minimizing the size of three-dimensional computational domains.

Solution of an eigenvalue problem for the Laplace operator on a spherical surface. M.S. Thesis - Maryland Univ.

NASA Technical Reports Server (NTRS)

Walden, H.

1974-01-01

Methods for obtaining approximate solutions for the fundamental eigenvalue of the Laplace-Beltrami operator (also referred to as the membrane eigenvalue problem for the vibration equation) on the unit spherical surface are developed. Two specific types of spherical surface domains are considered: (1) the interior of a spherical triangle, i.e., the region bounded by arcs of three great circles, and (2) the exterior of a great circle arc extending for less than pi radians on the sphere (a spherical surface with a slit). In both cases, zero boundary conditions are imposed. In order to solve the resulting second-order elliptic partial differential equations in two independent variables, a finite difference approximation is derived. The symmetric (generally five-point) finite difference equations that develop are written in matrix form and then solved by the iterative method of point successive overrelaxation. Upon convergence of this iterative method, the fundamental eigenvalue is approximated by iteration utilizing the power method as applied to the finite Rayleigh quotient.

The Bethe ansatz

NASA Astrophysics Data System (ADS)

Levkovich-Maslyuk, Fedor

2016-08-01

We give a pedagogical introduction to the Bethe ansatz techniques in integrable QFTs and spin chains. We first discuss and motivate the general framework of asymptotic Bethe ansatz for the spectrum of integrable QFTs in large volume, based on the exact S-matrix. Then we illustrate this method in several concrete theories. The first case we study is the SU(2) chiral Gross-Neveu model. We derive the Bethe equations via algebraic Bethe ansatz, solving in the process the Heisenberg XXX spin chain. We discuss this famous spin chain model in some detail, covering in particular the coordinate Bethe ansatz, some properties of Bethe states, and the classical scaling limit leading to finite-gap equations. Then we proceed to the more involved SU(3) chiral Gross-Neveu model and derive the Bethe equations using nested algebraic Bethe ansatz to solve the arising SU(3) spin chain. Finally we show how a method similar to the Bethe ansatz works in a completely different setting, namely for the 1D oscillator in quantum mechanics.

Bi-orthogonality relations for fluid-filled elastic cylindrical shells: Theory, generalisations and application to construct tailored Green's matrices

NASA Astrophysics Data System (ADS)

Ledet, Lasse S.; Sorokin, Sergey V.

2018-03-01

The paper addresses the classical problem of time-harmonic forced vibrations of a fluid-filled cylindrical shell considered as a multi-modal waveguide carrying infinitely many waves. The forced vibration problem is solved using tailored Green's matrices formulated in terms of eigenfunction expansions. The formulation of Green's matrix is based on special (bi-)orthogonality relations between the eigenfunctions, which are derived here for the fluid-filled shell. Further, the relations are generalised to any multi-modal symmetric waveguide. Using the orthogonality relations the transcendental equation system is converted into algebraic modal equations that can be solved analytically. Upon formulation of Green's matrices the solution space is studied in terms of completeness and convergence (uniformity and rate). Special features and findings exposed only through this modal decomposition method are elaborated and the physical interpretation of the bi-orthogonality relation is discussed in relation to the total energy flow which leads to derivation of simplified equations for the energy flow components.

Experiences on p-Version Time-Discontinuous Galerkin's Method for Nonlinear Heat Transfer Analysis and Sensitivity Analysis

NASA Technical Reports Server (NTRS)

Hou, Gene

2004-01-01

The focus of this research is on the development of analysis and sensitivity analysis equations for nonlinear, transient heat transfer problems modeled by p-version, time discontinuous finite element approximation. The resulting matrix equation of the state equation is simply in the form ofA(x)x = c, representing a single step, time marching scheme. The Newton-Raphson's method is used to solve the nonlinear equation. Examples are first provided to demonstrate the accuracy characteristics of the resultant finite element approximation. A direct differentiation approach is then used to compute the thermal sensitivities of a nonlinear heat transfer problem. The report shows that only minimal coding effort is required to enhance the analysis code with the sensitivity analysis capability.

Character expansion methods for matrix models of dually weighted graphs

NASA Astrophysics Data System (ADS)

Kazakov, Vladimir A.; Staudacher, Matthias; Wynter, Thomas

1996-04-01

We consider generalized one-matrix models in which external fields allow control over the coordination numbers on both the original and dual lattices. We rederive in a simple fashion a character expansion formula for these models originally due to Itzykson and Di Francesco, and then demonstrate how to take the large N limit of this expansion. The relationship to the usual matrix model resolvent is elucidated. Our methods give as a by-product an extremely simple derivation of the Migdal integral equation describing the large N limit of the Itzykson-Zuber formula. We illustrate and check our methods by analysing a number of models solvable by traditional means. We then proceed to solve a new model: a sum over planar graphys possessing even coordination numbers on both the original and the dual lattice. We conclude by formulating the equations for the case of arbitrary sets of even, self-dual coupling constants. This opens the way for studying the deep problems of phase transitions from random to flat lattices. January 1995

Efficient solution of parabolic equations by Krylov approximation methods

NASA Technical Reports Server (NTRS)

Gallopoulos, E.; Saad, Y.

1990-01-01

Numerical techniques for solving parabolic equations by the method of lines is addressed. The main motivation for the proposed approach is the possibility of exploiting a high degree of parallelism in a simple manner. The basic idea of the method is to approximate the action of the evolution operator on a given state vector by means of a projection process onto a Krylov subspace. Thus, the resulting approximation consists of applying an evolution operator of a very small dimension to a known vector which is, in turn, computed accurately by exploiting well-known rational approximations to the exponential. Because the rational approximation is only applied to a small matrix, the only operations required with the original large matrix are matrix-by-vector multiplications, and as a result the algorithm can easily be parallelized and vectorized. Some relevant approximation and stability issues are discussed. We present some numerical experiments with the method and compare its performance with a few explicit and implicit algorithms.

SU-G-TeP1-15: Toward a Novel GPU Accelerated Deterministic Solution to the Linear Boltzmann Transport Equation

DOE Office of Scientific and Technical Information (OSTI.GOV)

Yang, R; Fallone, B; Cross Cancer Institute, Edmonton, AB

Purpose: To develop a Graphic Processor Unit (GPU) accelerated deterministic solution to the Linear Boltzmann Transport Equation (LBTE) for accurate dose calculations in radiotherapy (RT). A deterministic solution yields the potential for major speed improvements due to the sparse matrix-vector and vector-vector multiplications and would thus be of benefit to RT. Methods: In order to leverage the massively parallel architecture of GPUs, the first order LBTE was reformulated as a second order self-adjoint equation using the Least Squares Finite Element Method (LSFEM). This produces a symmetric positive-definite matrix which is efficiently solved using a parallelized conjugate gradient (CG) solver. Themore » LSFEM formalism is applied in space, discrete ordinates is applied in angle, and the Multigroup method is applied in energy. The final linear system of equations produced is tightly coupled in space and angle. Our code written in CUDA-C was benchmarked on an Nvidia GeForce TITAN-X GPU against an Intel i7-6700K CPU. A spatial mesh of 30,950 tetrahedral elements was used with an S4 angular approximation. Results: To avoid repeating a full computationally intensive finite element matrix assembly at each Multigroup energy, a novel mapping algorithm was developed which minimized the operations required at each energy. Additionally, a parallelized memory mapping for the kronecker product between the sparse spatial and angular matrices, including Dirichlet boundary conditions, was created. Atomicity is preserved by graph-coloring overlapping nodes into separate kernel launches. The one-time mapping calculations for matrix assembly, kronecker product, and boundary condition application took 452±1ms on GPU. Matrix assembly for 16 energy groups took 556±3s on CPU, and 358±2ms on GPU using the mappings developed. The CG solver took 93±1s on CPU, and 468±2ms on GPU. Conclusion: Three computationally intensive subroutines in deterministically solving the LBTE have been formulated on GPU, resulting in two orders of magnitude speedup. Funding support from Natural Sciences and Engineering Research Council and Alberta Innovates Health Solutions. Dr. Fallone is a co-founder and CEO of MagnetTx Oncology Solutions (under discussions to license Alberta bi-planar linac MR for commercialization).« less

A new method for computation of eigenvector derivatives with distinct and repeated eigenvalues in structural dynamic analysis

NASA Astrophysics Data System (ADS)

Li, Zhengguang; Lai, Siu-Kai; Wu, Baisheng

2018-07-01

Determining eigenvector derivatives is a challenging task due to the singularity of the coefficient matrices of the governing equations, especially for those structural dynamic systems with repeated eigenvalues. An effective strategy is proposed to construct a non-singular coefficient matrix, which can be directly used to obtain the eigenvector derivatives with distinct and repeated eigenvalues. This approach also has an advantage that only requires eigenvalues and eigenvectors of interest, without solving the particular solutions of eigenvector derivatives. The Symmetric Quasi-Minimal Residual (SQMR) method is then adopted to solve the governing equations, only the existing factored (shifted) stiffness matrix from an iterative eigensolution such as the subspace iteration method or the Lanczos algorithm is utilized. The present method can deal with both cases of simple and repeated eigenvalues in a unified manner. Three numerical examples are given to illustrate the accuracy and validity of the proposed algorithm. Highly accurate approximations to the eigenvector derivatives are obtained within a few iteration steps, making a significant reduction of the computational effort. This method can be incorporated into a coupled eigensolver/derivative software module. In particular, it is applicable for finite element models with large sparse matrices.

Visible-infrared micro-spectrometer based on a preaggregated silver nanoparticle monolayer film and an infrared sensor card

NASA Astrophysics Data System (ADS)

Yang, Tao; Peng, Jing-xiao; Ho, Ho-pui; Song, Chun-yuan; Huang, Xiao-li; Zhu, Yong-yuan; Li, Xing-ao; Huang, Wei

2018-01-01

By using a preaggregated silver nanoparticle monolayer film and an infrared sensor card, we demonstrate a miniature spectrometer design that covers a broad wavelength range from visible to infrared with high spectral resolution. The spectral contents of an incident probe beam are reconstructed by solving a matrix equation with a smoothing simulated annealing algorithm. The proposed spectrometer offers significant advantages over current instruments that are based on Fourier transform and grating dispersion, in terms of size, resolution, spectral range, cost and reliability. The spectrometer contains three components, which are used for dispersion, frequency conversion and detection. Disordered silver nanoparticles in dispersion component reduce the fabrication complexity. An infrared sensor card in the conversion component broaden the operational spectral range of the system into visible and infrared bands. Since the CCD used in the detection component provides very large number of intensity measurements, one can reconstruct the final spectrum with high resolution. An additional feature of our algorithm for solving the matrix equation, which is suitable for reconstructing both broadband and narrowband signals, we have adopted a smoothing step based on a simulated annealing algorithm. This algorithm improve the accuracy of the spectral reconstruction.

On regularizing the MCTDH equations of motion

NASA Astrophysics Data System (ADS)

Meyer, Hans-Dieter; Wang, Haobin

2018-03-01

The Multiconfiguration Time-Dependent Hartree (MCTDH) approach leads to equations of motion (EOM) which become singular when there are unoccupied so-called single-particle functions (SPFs). Starting from a Hartree product, all SPFs, except the first one, are unoccupied initially. To solve the MCTDH-EOMs numerically, one therefore has to remove the singularity by a regularization procedure. Usually the inverse of a density matrix is regularized. Here we argue and show that regularizing the coefficient tensor, which in turn regularizes the density matrix as well, leads to an improved performance of the EOMs. The initially unoccupied SPFs are rotated faster into their "correct direction" in Hilbert space and the final results are less sensitive to the choice of the value of the regularization parameter. For a particular example (a spin-boson system studied with a transformed Hamiltonian), we could even show that only with the new regularization scheme could one obtain correct results. Finally, in Appendix A, a new integration scheme for the MCTDH-EOMs developed by Lubich and co-workers is discussed. It is argued that this scheme does not solve the problem of the unoccupied natural orbitals because this scheme ignores the latter and does not propagate them at all.

Free vibration of functionally graded beams and frameworks using the dynamic stiffness method

NASA Astrophysics Data System (ADS)

Banerjee, J. R.; Ananthapuvirajah, A.

2018-05-01

The free vibration analysis of functionally graded beams (FGBs) and frameworks containing FGBs is carried out by applying the dynamic stiffness method and deriving the elements of the dynamic stiffness matrix in explicit algebraic form. The usually adopted rule that the material properties of the FGB vary continuously through the thickness according to a power law forms the fundamental basis of the governing differential equations of motion in free vibration. The differential equations are solved in closed analytical form when the free vibratory motion is harmonic. The dynamic stiffness matrix is then formulated by relating the amplitudes of forces to those of the displacements at the two ends of the beam. Next, the explicit algebraic expressions for the dynamic stiffness elements are derived with the help of symbolic computation. Finally the Wittrick-Williams algorithm is applied as solution technique to solve the free vibration problems of FGBs with uniform cross-section, stepped FGBs and frameworks consisting of FGBs. Some numerical results are validated against published results, but in the absence of published results for frameworks containing FGBs, consistency checks on the reliability of results are performed. The paper closes with discussion of results and conclusions.

Biomechanically based simulation of brain deformations for intraoperative image correction: coupling of elastic and fluid models

NASA Astrophysics Data System (ADS)

Hagemann, Alexander; Rohr, Karl; Stiehl, H. Siegfried

2000-06-01

In order to improve the accuracy of image-guided neurosurgery, different biomechanical models have been developed to correct preoperative images w.r.t. intraoperative changes like brain shift or tumor resection. All existing biomechanical models simulate different anatomical structures by using either appropriate boundary conditions or by spatially varying material parameter values, while assuming the same physical model for all anatomical structures. In general, this leads to physically implausible results, especially in the case of adjacent elastic and fluid structures. Therefore, we propose a new approach which allows to couple different physical models. In our case, we simulate rigid, elastic, and fluid regions by using the appropriate physical description for each material, namely either the Navier equation or the Stokes equation. To solve the resulting differential equations, we derive a linear matrix system for each region by applying the finite element method (FEM). Thereafter, the linear matrix systems are linked together, ending up with one overall linear matrix system. Our approach has been tested using synthetic as well as tomographic images. It turns out from experiments, that the integrated treatment of rigid, elastic, and fluid regions significantly improves the prediction results in comparison to a pure linear elastic model.

MODFLOW–USG version 1: An unstructured grid version of MODFLOW for simulating groundwater flow and tightly coupled processes using a control volume finite-difference formulation

USGS Publications Warehouse

Panday, Sorab; Langevin, Christian D.; Niswonger, Richard G.; Ibaraki, Motomu; Hughes, Joseph D.

2013-01-01

A new version of MODFLOW, called MODFLOW–USG (for UnStructured Grid), was developed to support a wide variety of structured and unstructured grid types, including nested grids and grids based on prismatic triangles, rectangles, hexagons, and other cell shapes. Flexibility in grid design can be used to focus resolution along rivers and around wells, for example, or to subdiscretize individual layers to better represent hydrostratigraphic units. MODFLOW–USG is based on an underlying control volume finite difference (CVFD) formulation in which a cell can be connected to an arbitrary number of adjacent cells. To improve accuracy of the CVFD formulation for irregular grid-cell geometries or nested grids, a generalized Ghost Node Correction (GNC) Package was developed, which uses interpolated heads in the flow calculation between adjacent connected cells. MODFLOW–USG includes a Groundwater Flow (GWF) Process, based on the GWF Process in MODFLOW–2005, as well as a new Connected Linear Network (CLN) Process to simulate the effects of multi-node wells, karst conduits, and tile drains, for example. The CLN Process is tightly coupled with the GWF Process in that the equations from both processes are formulated into one matrix equation and solved simultaneously. This robustness results from using an unstructured grid with unstructured matrix storage and solution schemes. MODFLOW–USG also contains an optional Newton-Raphson formulation, based on the formulation in MODFLOW–NWT, for improving solution convergence and avoiding problems with the drying and rewetting of cells. Because the existing MODFLOW solvers were developed for structured and symmetric matrices, they were replaced with a new Sparse Matrix Solver (SMS) Package developed specifically for MODFLOW–USG. The SMS Package provides several methods for resolving nonlinearities and multiple symmetric and asymmetric linear solution schemes to solve the matrix arising from the flow equations and the Newton-Raphson formulation, respectively.

Uniformity Masks Design Method Based on the Shadow Matrix for Coating Materials with Different Condensation Characteristics

PubMed Central

2013-01-01

An intuitionistic method is proposed to design shadow masks to achieve thickness profile control for evaporation coating processes. The proposed method is based on the concept of the shadow matrix, which is a matrix that contains coefficients that build quantitive relations between shape parameters of masks and shadow quantities of substrate directly. By using the shadow matrix, shape parameters of shadow masks could be derived simply by solving a matrix equation. Verification experiments were performed on a special case where coating materials have different condensation characteristics. By using the designed mask pair with complementary shapes, thickness uniformities of better than 98% are demonstrated for MgF2 (m = 1) and LaF3 (m = 0.5) simultaneously on a 280 mm diameter spherical substrate with the radius curvature of 200 mm. PMID:24227996

Derivative free Davidon-Fletcher-Powell (DFP) for solving symmetric systems of nonlinear equations

NASA Astrophysics Data System (ADS)

Mamat, M.; Dauda, M. K.; Mohamed, M. A. bin; Waziri, M. Y.; Mohamad, F. S.; Abdullah, H.

2018-03-01

Research from the work of engineers, economist, modelling, industry, computing, and scientist are mostly nonlinear equations in nature. Numerical solution to such systems is widely applied in those areas of mathematics. Over the years, there has been significant theoretical study to develop methods for solving such systems, despite these efforts, unfortunately the methods developed do have deficiency. In a contribution to solve systems of the form F(x) = 0, x ∈ Rn , a derivative free method via the classical Davidon-Fletcher-Powell (DFP) update is presented. This is achieved by simply approximating the inverse Hessian matrix with {Q}k+1-1 to θkI. The modified method satisfied the descent condition and possess local superlinear convergence properties. Interestingly, without computing any derivative, the proposed method never fail to converge throughout the numerical experiments. The output is based on number of iterations and CPU time, different initial starting points were used on a solve 40 benchmark test problems. With the aid of the squared norm merit function and derivative-free line search technique, the approach yield a method of solving symmetric systems of nonlinear equations that is capable of significantly reducing the CPU time and number of iteration, as compared to its counterparts. A comparison between the proposed method and classical DFP update were made and found that the proposed methodis the top performer and outperformed the existing method in almost all the cases. In terms of number of iterations, out of the 40 problems solved, the proposed method solved 38 successfully, (95%) while classical DFP solved 2 problems (i.e. 05%). In terms of CPU time, the proposed method solved 29 out of the 40 problems given, (i.e.72.5%) successfully whereas classical DFP solves 11 (27.5%). The method is valid in terms of derivation, reliable in terms of number of iterations and accurate in terms of CPU time. Thus, suitable and achived the objective.

Parallelization of the Physical-Space Statistical Analysis System (PSAS)

NASA Technical Reports Server (NTRS)

Larson, J. W.; Guo, J.; Lyster, P. M.

1999-01-01

Atmospheric data assimilation is a method of combining observations with model forecasts to produce a more accurate description of the atmosphere than the observations or forecast alone can provide. Data assimilation plays an increasingly important role in the study of climate and atmospheric chemistry. The NASA Data Assimilation Office (DAO) has developed the Goddard Earth Observing System Data Assimilation System (GEOS DAS) to create assimilated datasets. The core computational components of the GEOS DAS include the GEOS General Circulation Model (GCM) and the Physical-space Statistical Analysis System (PSAS). The need for timely validation of scientific enhancements to the data assimilation system poses computational demands that are best met by distributed parallel software. PSAS is implemented in Fortran 90 using object-based design principles. The analysis portions of the code solve two equations. The first of these is the "innovation" equation, which is solved on the unstructured observation grid using a preconditioned conjugate gradient (CG) method. The "analysis" equation is a transformation from the observation grid back to a structured grid, and is solved by a direct matrix-vector multiplication. Use of a factored-operator formulation reduces the computational complexity of both the CG solver and the matrix-vector multiplication, rendering the matrix-vector multiplications as a successive product of operators on a vector. Sparsity is introduced to these operators by partitioning the observations using an icosahedral decomposition scheme. PSAS builds a large (approx. 128MB) run-time database of parameters used in the calculation of these operators. Implementing a message passing parallel computing paradigm into an existing yet developing computational system as complex as PSAS is nontrivial. One of the technical challenges is balancing the requirements for computational reproducibility with the need for high performance. The problem of computational reproducibility is well known in the parallel computing community. It is a requirement that the parallel code perform calculations in a fashion that will yield identical results on different configurations of processing elements on the same platform. In some cases this problem can be solved by sacrificing performance. Meeting this requirement and still achieving high performance is very difficult. Topics to be discussed include: current PSAS design and parallelization strategy; reproducibility issues; load balance vs. database memory demands, possible solutions to these problems.

Time-domain finite elements in optimal control with application to launch-vehicle guidance. PhD. Thesis

NASA Technical Reports Server (NTRS)

Bless, Robert R.

1991-01-01

A time-domain finite element method is developed for optimal control problems. The theory derived is general enough to handle a large class of problems including optimal control problems that are continuous in the states and controls, problems with discontinuities in the states and/or system equations, problems with control inequality constraints, problems with state inequality constraints, or problems involving any combination of the above. The theory is developed in such a way that no numerical quadrature is necessary regardless of the degree of nonlinearity in the equations. Also, the same shape functions may be employed for every problem because all strong boundary conditions are transformed into natural or weak boundary conditions. In addition, the resulting nonlinear algebraic equations are very sparse. Use of sparse matrix solvers allows for the rapid and accurate solution of very difficult optimization problems. The formulation is applied to launch-vehicle trajectory optimization problems, and results show that real-time optimal guidance is realizable with this method. Finally, a general problem solving environment is created for solving a large class of optimal control problems. The algorithm uses both FORTRAN and a symbolic computation program to solve problems with a minimum of user interaction. The use of symbolic computation eliminates the need for user-written subroutines which greatly reduces the setup time for solving problems.

A GPU-accelerated semi-implicit fractional-step method for numerical solutions of incompressible Navier-Stokes equations

NASA Astrophysics Data System (ADS)

Ha, Sanghyun; Park, Junshin; You, Donghyun

2018-01-01

Utility of the computational power of Graphics Processing Units (GPUs) is elaborated for solutions of incompressible Navier-Stokes equations which are integrated using a semi-implicit fractional-step method. The Alternating Direction Implicit (ADI) and the Fourier-transform-based direct solution methods used in the semi-implicit fractional-step method take advantage of multiple tridiagonal matrices whose inversion is known as the major bottleneck for acceleration on a typical multi-core machine. A novel implementation of the semi-implicit fractional-step method designed for GPU acceleration of the incompressible Navier-Stokes equations is presented. Aspects of the programing model of Compute Unified Device Architecture (CUDA), which are critical to the bandwidth-bound nature of the present method are discussed in detail. A data layout for efficient use of CUDA libraries is proposed for acceleration of tridiagonal matrix inversion and fast Fourier transform. OpenMP is employed for concurrent collection of turbulence statistics on a CPU while the Navier-Stokes equations are computed on a GPU. Performance of the present method using CUDA is assessed by comparing the speed of solving three tridiagonal matrices using ADI with the speed of solving one heptadiagonal matrix using a conjugate gradient method. An overall speedup of 20 times is achieved using a Tesla K40 GPU in comparison with a single-core Xeon E5-2660 v3 CPU in simulations of turbulent boundary-layer flow over a flat plate conducted on over 134 million grids. Enhanced performance of 48 times speedup is reached for the same problem using a Tesla P100 GPU.

An incremental strategy for calculating consistent discrete CFD sensitivity derivatives

NASA Technical Reports Server (NTRS)

Korivi, Vamshi Mohan; Taylor, Arthur C., III; Newman, Perry A.; Hou, Gene W.; Jones, Henry E.

1992-01-01

In this preliminary study involving advanced computational fluid dynamic (CFD) codes, an incremental formulation, also known as the 'delta' or 'correction' form, is presented for solving the very large sparse systems of linear equations which are associated with aerodynamic sensitivity analysis. For typical problems in 2D, a direct solution method can be applied to these linear equations which are associated with aerodynamic sensitivity analysis. For typical problems in 2D, a direct solution method can be applied to these linear equations in either the standard or the incremental form, in which case the two are equivalent. Iterative methods appear to be needed for future 3D applications; however, because direct solver methods require much more computer memory than is currently available. Iterative methods for solving these equations in the standard form result in certain difficulties, such as ill-conditioning of the coefficient matrix, which can be overcome when these equations are cast in the incremental form; these and other benefits are discussed. The methodology is successfully implemented and tested in 2D using an upwind, cell-centered, finite volume formulation applied to the thin-layer Navier-Stokes equations. Results are presented for two laminar sample problems: (1) transonic flow through a double-throat nozzle; and (2) flow over an isolated airfoil.

Iterative and multigrid methods in the finite element solution of incompressible and turbulent fluid flow

NASA Astrophysics Data System (ADS)

Lavery, N.; Taylor, C.

1999-07-01

Multigrid and iterative methods are used to reduce the solution time of the matrix equations which arise from the finite element (FE) discretisation of the time-independent equations of motion of the incompressible fluid in turbulent motion. Incompressible flow is solved by using the method of reduce interpolation for the pressure to satisfy the Brezzi-Babuska condition. The k-l model is used to complete the turbulence closure problem. The non-symmetric iterative matrix methods examined are the methods of least squares conjugate gradient (LSCG), biconjugate gradient (BCG), conjugate gradient squared (CGS), and the biconjugate gradient squared stabilised (BCGSTAB). The multigrid algorithm applied is based on the FAS algorithm of Brandt, and uses two and three levels of grids with a V-cycling schedule. These methods are all compared to the non-symmetric frontal solver. Copyright

Study of modal coupling procedures for the shuttle: A matrix method for damping synthesis

NASA Technical Reports Server (NTRS)

Hasselman, T. K.

1972-01-01

The damping method was applied successfully to real structures as well as analytical models. It depends on the ability to determine an appropriate modal damping matrix for each substructure. In the past, modal damping matrices were assumed diagonal for lack of being able to determine the coupling terms which are significant in the general case of nonproportional damping. This problem was overcome by formulating the damped equations of motion as a linear perturbation of the undamped equations for light structural damping. Damped modes are defined as complex vectors derived from the complex frequency response vectors of each substructure and are obtained directly from sinusoidal vibration tests. The damped modes are used to compute first order approximations to the modal damping matrices. The perturbation approach avoids ever having to solve a complex eigenvalue problem.

On the parallel solution of parabolic equations

NASA Technical Reports Server (NTRS)

Gallopoulos, E.; Saad, Youcef

1989-01-01

Parallel algorithms for the solution of linear parabolic problems are proposed. The first of these methods is based on using polynomial approximation to the exponential. It does not require solving any linear systems and is highly parallelizable. The two other methods proposed are based on Pade and Chebyshev approximations to the matrix exponential. The parallelization of these methods is achieved by using partial fraction decomposition techniques to solve the resulting systems and thus offers the potential for increased time parallelism in time dependent problems. Experimental results from the Alliant FX/8 and the Cray Y-MP/832 vector multiprocessors are also presented.

Finite element solution of transient fluid-structure interaction problems

NASA Technical Reports Server (NTRS)

Everstine, Gordon C.; Cheng, Raymond S.; Hambric, Stephen A.

1991-01-01

A finite element approach using NASTRAN is developed for solving time-dependent fluid-structure interaction problems, with emphasis on the transient scattering of acoustic waves from submerged elastic structures. Finite elements are used for modeling both structure and fluid domains to facilitate the graphical display of the wave motion through both media. For the liquid, the use of velocity potential as the fundamental unknown results in a symmetric matrix equation. The approach is illustrated for the problem of transient scattering from a submerged elastic spherical shell subjected to an incident tone burst. The use of an analogy between the equations of elasticity and the wave equation of acoustics, a necessary ingredient to the procedure, is summarized.

Systems of Inhomogeneous Linear Equations

NASA Astrophysics Data System (ADS)

Scherer, Philipp O. J.

Many problems in physics and especially computational physics involve systems of linear equations which arise e.g. from linearization of a general nonlinear problem or from discretization of differential equations. If the dimension of the system is not too large standard methods like Gaussian elimination or QR decomposition are sufficient. Systems with a tridiagonal matrix are important for cubic spline interpolation and numerical second derivatives. They can be solved very efficiently with a specialized Gaussian elimination method. Practical applications often involve very large dimensions and require iterative methods. Convergence of Jacobi and Gauss-Seidel methods is slow and can be improved by relaxation or over-relaxation. An alternative for large systems is the method of conjugate gradients.

Finite element concepts in computational aerodynamics

NASA Technical Reports Server (NTRS)

Baker, A. J.

1978-01-01

Finite element theory was employed to establish an implicit numerical solution algorithm for the time averaged unsteady Navier-Stokes equations. Both the multidimensional and a time-split form of the algorithm were considered, the latter of particular interest for problem specification on a regular mesh. A Newton matrix iteration procedure is outlined for solving the resultant nonlinear algebraic equation systems. Multidimensional discretization procedures are discussed with emphasis on automated generation of specific nonuniform solution grids and accounting of curved surfaces. The time-split algorithm was evaluated with regards to accuracy and convergence properties for hyperbolic equations on rectangular coordinates. An overall assessment of the viability of the finite element concept for computational aerodynamics is made.

Multi-color incomplete Cholesky conjugate gradient methods for vector computers

DOE Office of Scientific and Technical Information (OSTI.GOV)

Poole, E.L.

1986-01-01

This research is concerned with the solution on vector computers of linear systems of equations. Ax = b, where A is a large, sparse symmetric positive definite matrix with non-zero elements lying only along a few diagonals of the matrix. The system is solved using the incomplete Cholesky conjugate gradient method (ICCG). Multi-color orderings are used of the unknowns in the linear system to obtain p-color matrices for which a no-fill block ICCG method is implemented on the CYBER 205 with O(N/p) length vector operations in both the decomposition of A and, more importantly, in the forward and back solvesmore » necessary at each iteration of the method. (N is the number of unknowns and p is a small constant). A p-colored matrix is a matrix that can be partitioned into a p x p block matrix where the diagonal blocks are diagonal matrices. The matrix is stored by diagonals and matrix multiplication by diagonals is used to carry out the decomposition of A and the forward and back solves. Additionally, if the vectors across adjacent blocks line up, then some of the overhead associated with vector startups can be eliminated in the matrix vector multiplication necessary at each conjugate gradient iteration. Necessary and sufficient conditions are given to determine which multi-color orderings of the unknowns correspond to p-color matrices, and a process is indicated for choosing multi-color orderings.« less

Robust parallel iterative solvers for linear and least-squares problems, Final Technical Report

DOE Office of Scientific and Technical Information (OSTI.GOV)

Saad, Yousef

2014-01-16

The primary goal of this project is to study and develop robust iterative methods for solving linear systems of equations and least squares systems. The focus of the Minnesota team is on algorithms development, robustness issues, and on tests and validation of the methods on realistic problems. 1. The project begun with an investigation on how to practically update a preconditioner obtained from an ILU-type factorization, when the coefficient matrix changes. 2. We investigated strategies to improve robustness in parallel preconditioners in a specific case of a PDE with discontinuous coefficients. 3. We explored ways to adapt standard preconditioners formore » solving linear systems arising from the Helmholtz equation. These are often difficult linear systems to solve by iterative methods. 4. We have also worked on purely theoretical issues related to the analysis of Krylov subspace methods for linear systems. 5. We developed an effective strategy for performing ILU factorizations for the case when the matrix is highly indefinite. The strategy uses shifting in some optimal way. The method was extended to the solution of Helmholtz equations by using complex shifts, yielding very good results in many cases. 6. We addressed the difficult problem of preconditioning sparse systems of equations on GPUs. 7. A by-product of the above work is a software package consisting of an iterative solver library for GPUs based on CUDA. This was made publicly available. It was the first such library that offers complete iterative solvers for GPUs. 8. We considered another form of ILU which blends coarsening techniques from Multigrid with algebraic multilevel methods. 9. We have released a new version on our parallel solver - called pARMS [new version is version 3]. As part of this we have tested the code in complex settings - including the solution of Maxwell and Helmholtz equations and for a problem of crystal growth.10. As an application of polynomial preconditioning we considered the problem of evaluating f(A)v which arises in statistical sampling. 11. As an application to the methods we developed, we tackled the problem of computing the diagonal of the inverse of a matrix. This arises in statistical applications as well as in many applications in physics. We explored probing methods as well as domain-decomposition type methods. 12. A collaboration with researchers from Toulouse, France, considered the important problem of computing the Schur complement in a domain-decomposition approach. 13. We explored new ways of preconditioning linear systems, based on low-rank approximations.« less

A diagonal implicit scheme for computing flows with finite-rate chemistry

NASA Technical Reports Server (NTRS)

Eberhardt, Scott; Imlay, Scott

1990-01-01

A new algorithm for solving steady, finite-rate chemistry, flow problems is presented. The new scheme eliminates the expense of inverting large block matrices that arise when species conservation equations are introduced. The source Jacobian matrix is replaced by a diagonal matrix which is tailored to account for the fastest reactions in the chemical system. A point-implicit procedure is discussed and then the algorithm is included into the LU-SGS scheme. Solutions are presented for hypervelocity reentry and Hydrogen-Oxygen combustion. For the LU-SGS scheme a CFL number in excess of 10,000 has been achieved.

Using Chebyshev polynomials and approximate inverse triangular factorizations for preconditioning the conjugate gradient method

NASA Astrophysics Data System (ADS)

Kaporin, I. E.

2012-02-01

In order to precondition a sparse symmetric positive definite matrix, its approximate inverse is examined, which is represented as the product of two sparse mutually adjoint triangular matrices. In this way, the solution of the corresponding system of linear algebraic equations (SLAE) by applying the preconditioned conjugate gradient method (CGM) is reduced to performing only elementary vector operations and calculating sparse matrix-vector products. A method for constructing the above preconditioner is described and analyzed. The triangular factor has a fixed sparsity pattern and is optimal in the sense that the preconditioned matrix has a minimum K-condition number. The use of polynomial preconditioning based on Chebyshev polynomials makes it possible to considerably reduce the amount of scalar product operations (at the cost of an insignificant increase in the total number of arithmetic operations). The possibility of an efficient massively parallel implementation of the resulting method for solving SLAEs is discussed. For a sequential version of this method, the results obtained by solving 56 test problems from the Florida sparse matrix collection (which are large-scale and ill-conditioned) are presented. These results show that the method is highly reliable and has low computational costs.

Accurate spectral solutions for the parabolic and elliptic partial differential equations by the ultraspherical tau method

NASA Astrophysics Data System (ADS)

Doha, E. H.; Abd-Elhameed, W. M.

2005-09-01

We present a double ultraspherical spectral methods that allow the efficient approximate solution for the parabolic partial differential equations in a square subject to the most general inhomogeneous mixed boundary conditions. The differential equations with their boundary and initial conditions are reduced to systems of ordinary differential equations for the time-dependent expansion coefficients. These systems are greatly simplified by using tensor matrix algebra, and are solved by using the step-by-step method. Numerical applications of how to use these methods are described. Numerical results obtained compare favorably with those of the analytical solutions. Accurate double ultraspherical spectral approximations for Poisson's and Helmholtz's equations are also noted. Numerical experiments show that spectral approximation based on Chebyshev polynomials of the first kind is not always better than others based on ultraspherical polynomials.

A systematic linear space approach to solving partially described inverse eigenvalue problems

NASA Astrophysics Data System (ADS)

Hu, Sau-Lon James; Li, Haujun

2008-06-01

Most applications of the inverse eigenvalue problem (IEP), which concerns the reconstruction of a matrix from prescribed spectral data, are associated with special classes of structured matrices. Solving the IEP requires one to satisfy both the spectral constraint and the structural constraint. If the spectral constraint consists of only one or few prescribed eigenpairs, this kind of inverse problem has been referred to as the partially described inverse eigenvalue problem (PDIEP). This paper develops an efficient, general and systematic approach to solve the PDIEP. Basically, the approach, applicable to various structured matrices, converts the PDIEP into an ordinary inverse problem that is formulated as a set of simultaneous linear equations. While solving simultaneous linear equations for model parameters, the singular value decomposition method is applied. Because of the conversion to an ordinary inverse problem, other constraints associated with the model parameters can be easily incorporated into the solution procedure. The detailed derivation and numerical examples to implement the newly developed approach to symmetric Toeplitz and quadratic pencil (including mass, damping and stiffness matrices of a linear dynamic system) PDIEPs are presented. Excellent numerical results for both kinds of problem are achieved under the situations that have either unique or infinitely many solutions.

Off-axis impact of unidirectional composites with cracks: Dynamic stress intensification

NASA Technical Reports Server (NTRS)

Sih, G. C.; Chen, E. P.

1979-01-01

The dynamic response of unidirectional composites under off axis (angle loading) impact is analyzed by assuming that the composite contains an initial flaw in the matrix material. The analytical method utilizes Fourier transform for the space variable and Laplace transform for the time variable. The off axis impact is separated into two parts, one being symmetric and the other skew-symmetric with reference to the crack plane. Transient boundary conditions of normal and shear tractions are applied to a crack embedded in the matrix of the unidirectional composite. The two boundary conditions are solved independently and the results superimposed. Mathematically, these conditions reduce the problem to a system of dual integral equations which are solved in the Laplace transform plane for the transformation of the dynamic stress intensity factor. The time inversion is carried out numerically for various combinations of the material properties of the composite and the results are displayed graphically.

Efficient sparse matrix-matrix multiplication for computing periodic responses by shooting method on Intel Xeon Phi

NASA Astrophysics Data System (ADS)

Stoykov, S.; Atanassov, E.; Margenov, S.

2016-10-01

Many of the scientific applications involve sparse or dense matrix operations, such as solving linear systems, matrix-matrix products, eigensolvers, etc. In what concerns structural nonlinear dynamics, the computations of periodic responses and the determination of stability of the solution are of primary interest. Shooting method iswidely used for obtaining periodic responses of nonlinear systems. The method involves simultaneously operations with sparse and dense matrices. One of the computationally expensive operations in the method is multiplication of sparse by dense matrices. In the current work, a new algorithm for sparse matrix by dense matrix products is presented. The algorithm takes into account the structure of the sparse matrix, which is obtained by space discretization of the nonlinear Mindlin's plate equation of motion by the finite element method. The algorithm is developed to use the vector engine of Intel Xeon Phi coprocessors. It is compared with the standard sparse matrix by dense matrix algorithm and the one developed by Intel MKL and it is shown that by considering the properties of the sparse matrix better algorithms can be developed.

Photonic Breast Tomography and Tumor Aggressiveness Assessment

DTIC Science & Technology

2011-07-01

incorporates, in optical domain, the vector subspace classification method, Multiple Signal Classification ( MUSIC ). MUSIC was developed by Devaney...and co-workers for finding the location of scattering targets whose size is smaller than the wavelength of acoustic waves or electromagnetic waves...general area of array processing for acoustic and radar time-reversal imaging [12]. The eigenvalue equation of TR matrix is solved, and the signal and

Inelastic Transitions in Slow Collisions of Anti-Hydrogen with Hydrogen Atoms

NASA Astrophysics Data System (ADS)

Harrison, Robert; Krstic, Predrag

2007-06-01

We calculate excited adiabatic states and nonadiabatic coupling matrix elements of a quasimolecular system containing hydrogen and anti-hydrogen atoms, for a range of internuclear distances from 0.2 to 20 Bohrs. High accuracy is achieved by exact diagonalization of the molecular Hamiltionian in a large Gaussian basis. Nonadiabatic dynamics was calculated by solving MOCC equations. Positronium states are included in the consideration.

Genetic Algorithm Optimization of Phononic Bandgap Structures

DTIC Science & Technology

2006-09-01

a GA with a computational finite element method for solving the acoustic wave equation, and find optimal designs for both metal-matrix composite...systems consisting of Ti/SiC, and H2O-filled porous ceramic media, by maximizing the relative acoustic bandgap for these media. The term acoustic here...stress minimization, global optimization, phonon bandgap, genetic algorithm, periodic elastic media, inhomogeneity, inclusion, porous media, acoustic

Poisson-Nernst-Planck equations for simulating biomolecular diffusion-reaction processes I: Finite element solutions

DOE Office of Scientific and Technical Information (OSTI.GOV)

Lu Benzhuo; Holst, Michael J.; Center for Theoretical Biological Physics, University of California San Diego, La Jolla, CA 92093

2010-09-20

In this paper we developed accurate finite element methods for solving 3-D Poisson-Nernst-Planck (PNP) equations with singular permanent charges for simulating electrodiffusion in solvated biomolecular systems. The electrostatic Poisson equation was defined in the biomolecules and in the solvent, while the Nernst-Planck equation was defined only in the solvent. We applied a stable regularization scheme to remove the singular component of the electrostatic potential induced by the permanent charges inside biomolecules, and formulated regular, well-posed PNP equations. An inexact-Newton method was used to solve the coupled nonlinear elliptic equations for the steady problems; while an Adams-Bashforth-Crank-Nicolson method was devised formore » time integration for the unsteady electrodiffusion. We numerically investigated the conditioning of the stiffness matrices for the finite element approximations of the two formulations of the Nernst-Planck equation, and theoretically proved that the transformed formulation is always associated with an ill-conditioned stiffness matrix. We also studied the electroneutrality of the solution and its relation with the boundary conditions on the molecular surface, and concluded that a large net charge concentration is always present near the molecular surface due to the presence of multiple species of charged particles in the solution. The numerical methods are shown to be accurate and stable by various test problems, and are applicable to real large-scale biophysical electrodiffusion problems.« less

Poisson-Nernst-Planck Equations for Simulating Biomolecular Diffusion-Reaction Processes I: Finite Element Solutions

PubMed Central

Lu, Benzhuo; Holst, Michael J.; McCammon, J. Andrew; Zhou, Y. C.

2010-01-01

In this paper we developed accurate finite element methods for solving 3-D Poisson-Nernst-Planck (PNP) equations with singular permanent charges for electrodiffusion in solvated biomolecular systems. The electrostatic Poisson equation was defined in the biomolecules and in the solvent, while the Nernst-Planck equation was defined only in the solvent. We applied a stable regularization scheme to remove the singular component of the electrostatic potential induced by the permanent charges inside biomolecules, and formulated regular, well-posed PNP equations. An inexact-Newton method was used to solve the coupled nonlinear elliptic equations for the steady problems; while an Adams-Bashforth-Crank-Nicolson method was devised for time integration for the unsteady electrodiffusion. We numerically investigated the conditioning of the stiffness matrices for the finite element approximations of the two formulations of the Nernst-Planck equation, and theoretically proved that the transformed formulation is always associated with an ill-conditioned stiffness matrix. We also studied the electroneutrality of the solution and its relation with the boundary conditions on the molecular surface, and concluded that a large net charge concentration is always present near the molecular surface due to the presence of multiple species of charged particles in the solution. The numerical methods are shown to be accurate and stable by various test problems, and are applicable to real large-scale biophysical electrodiffusion problems. PMID:21709855

Poisson-Nernst-Planck Equations for Simulating Biomolecular Diffusion-Reaction Processes I: Finite Element Solutions.

PubMed

Lu, Benzhuo; Holst, Michael J; McCammon, J Andrew; Zhou, Y C

2010-09-20

In this paper we developed accurate finite element methods for solving 3-D Poisson-Nernst-Planck (PNP) equations with singular permanent charges for electrodiffusion in solvated biomolecular systems. The electrostatic Poisson equation was defined in the biomolecules and in the solvent, while the Nernst-Planck equation was defined only in the solvent. We applied a stable regularization scheme to remove the singular component of the electrostatic potential induced by the permanent charges inside biomolecules, and formulated regular, well-posed PNP equations. An inexact-Newton method was used to solve the coupled nonlinear elliptic equations for the steady problems; while an Adams-Bashforth-Crank-Nicolson method was devised for time integration for the unsteady electrodiffusion. We numerically investigated the conditioning of the stiffness matrices for the finite element approximations of the two formulations of the Nernst-Planck equation, and theoretically proved that the transformed formulation is always associated with an ill-conditioned stiffness matrix. We also studied the electroneutrality of the solution and its relation with the boundary conditions on the molecular surface, and concluded that a large net charge concentration is always present near the molecular surface due to the presence of multiple species of charged particles in the solution. The numerical methods are shown to be accurate and stable by various test problems, and are applicable to real large-scale biophysical electrodiffusion problems.

Wave propagation through an inhomogeneous slab sandwiched by the piezoelectric and the piezomagnetic half spaces.

PubMed

Jiao, Fengyu; Wei, Peijun; Li, Li

2017-01-01

Wave propagation through a gradient slab sandwiched by the piezoelectric and the piezomagnetic half spaces are studied in this paper. First, the secular equations in the transverse isotropic piezoelectric/piezomagnetic half spaces are derived from the general dynamic equation. Then, the state vectors at piezoelectric and piezomagnetic half spaces are related to the amplitudes of various possible waves. The state transfer equation of the functionally graded slab is derived from the equations of motion by the reduction of order, and the transfer matrix of the functionally gradient slab is obtained by solving the state transfer equation with the spatial-varying coefficient. Finally, the continuous interface conditions are used to lead to the resultant algebraic equations. The algebraic equations are solved to obtain the amplitude ratios of various waves which are further used to obtain the energy reflection and transmission coefficients of various waves. The numerical results are shown graphically and are validated by the energy conservation law. Based on the numerical results on the fives of gradient profiles, the influences of the graded slab on the wave propagation are discussed. It is found that the reflection and transmission coefficients are obviously dependent upon the gradient profile. The various surface waves are more sensitive to the gradient profile than the bulk waves. Copyright © 2016 Elsevier B.V. All rights reserved.

Using the Multiplicative Schwarz Alternating Algorithm (MSAA) for Solving the Large Linear System of Equations Related to Global Gravity Field Recovery up to Degree and Order 120

NASA Astrophysics Data System (ADS)

Safari, A.; Sharifi, M. A.; Amjadiparvar, B.

2010-05-01

The GRACE mission has substantiated the low-low satellite-to-satellite tracking (LL-SST) concept. The LL-SST configuration can be combined with the previously realized high-low SST concept in the CHAMP mission to provide a much higher accuracy. The line of sight (LOS) acceleration difference between the GRACE satellite pair is the mostly used observable for mapping the global gravity field of the Earth in terms of spherical harmonic coefficients. In this paper, mathematical formulae for LOS acceleration difference observations have been derived and the corresponding linear system of equations has been set up for spherical harmonic up to degree and order 120. The total number of unknowns is 14641. Such a linear equation system can be solved with iterative solvers or direct solvers. However, the runtime of direct methods or that of iterative solvers without a suitable preconditioner increases tremendously. This is the reason why we need a more sophisticated method to solve the linear system of problems with a large number of unknowns. Multiplicative variant of the Schwarz alternating algorithm is a domain decomposition method, which allows it to split the normal matrix of the system into several smaller overlaped submatrices. In each iteration step the multiplicative variant of the Schwarz alternating algorithm solves linear systems with the matrices obtained from the splitting successively. It reduces both runtime and memory requirements drastically. In this paper we propose the Multiplicative Schwarz Alternating Algorithm (MSAA) for solving the large linear system of gravity field recovery. The proposed algorithm has been tested on the International Association of Geodesy (IAG)-simulated data of the GRACE mission. The achieved results indicate the validity and efficiency of the proposed algorithm in solving the linear system of equations from accuracy and runtime points of view. Keywords: Gravity field recovery, Multiplicative Schwarz Alternating Algorithm, Low-Low Satellite-to-Satellite Tracking

Méthode du second membre modifié pour la gestion de rapports de viscosité importants dans le problème de Stokes bifluide

NASA Astrophysics Data System (ADS)

Bui, Thi Thu Cuc; Frey, Pascal; Maury, Bertrand

2008-06-01

In this Note, we present a method to solve numerically the Stokes equation for the incompressible flow between two immiscible fluids presenting very different viscosities. The resolution of the finite element systems of equations is performed using Uzawa's method. The stiffness matrix conditioning problems related to the very important viscosity ratios are circumvented using an new iterative scheme. A numerical example is proposed to show the efficiency of this approach. To cite this article: T.T.C. Bui et al., C. R. Mecanique 336 (2008).

Nonlinear equation of the modes in circular slab waveguides and its application.

PubMed

Zhu, Jianxin; Zheng, Jia

2013-11-20

In this paper, circularly curved inhomogeneous waveguides are transformed into straight inhomogeneous waveguides first by a conformal mapping. Then, the differential transfer matrix method is introduced and adopted to deduce the exact dispersion relation for modes. This relation itself is complex and difficult to solve, but it can be approximated by a simpler nonlinear equation in practical applications, which is close to the exact relation and quite easy to analyze. Afterward, optimized asymptotic solutions are obtained and act as initial guesses for the following Newton's iteration. Finally, very accurate solutions are achieved in the numerical experiment.

Calculation of compressible flow about three-dimensional inlets with auxiliary inlets, slats and vanes by means of a panel method

NASA Technical Reports Server (NTRS)

Hess, J. L.; Friedman, D. M.; Clark, R. W.

1985-01-01

An efficient and user oriented method was constructed for calculating flow in and about complex inlet configurations. Efficiency is attained by: (1) the use of a panel method; (2) a technique of superposition for obtaining solutions at any inlet operating condition; and (3) employment of an advanced matrix iteration technique for solving large full systems of equations, including the nonlinear equations for the Kutta condition. User concerns are addressed by the provision of several novel graphical output options that yield a more complete comprehension of the flowfield than was possible previously.

Optimal control of parametric oscillations of compressed flexible bars

NASA Astrophysics Data System (ADS)

Alesova, I. M.; Babadzanjanz, L. K.; Pototskaya, I. Yu.; Pupysheva, Yu. Yu.; Saakyan, A. T.

2018-05-01

In this paper the problem of damping of the linear systems oscillations with piece-wise constant control is solved. The motion of bar construction is reduced to the form described by Hill's differential equation using the Bubnov-Galerkin method. To calculate switching moments of the one-side control the method of sequential linear programming is used. The elements of the fundamental matrix of the Hill's equation are approximated by trigonometric series. Examples of the optimal control of the systems for various initial conditions and different number of control stages have been calculated. The corresponding phase trajectories and transient processes are represented.

Numerical Solution of the Electron Transport Equation in the Upper Atmosphere

DOE Office of Scientific and Technical Information (OSTI.GOV)

Woods, Mark Christopher; Holmes, Mark; Sailor, William C

A new approach for solving the electron transport equation in the upper atmosphere is derived. The problem is a very stiff boundary value problem, and to obtain an accurate numerical solution, matrix factorizations are used to decouple the fast and slow modes. A stable finite difference method is applied to each mode. This solver is applied to a simplifieed problem for which an exact solution exists using various versions of the boundary conditions that might arise in a natural auroral display. The numerical and exact solutions are found to agree with each other to at least two significant digits.

Efficient Power Network Analysis with Modeling of Inductive Effects

NASA Astrophysics Data System (ADS)

Zeng, Shan; Yu, Wenjian; Hong, Xianlong; Cheng, Chung-Kuan

In this paper, an efficient method is proposed to accurately analyze large-scale power/ground (P/G) networks, where inductive parasitics are modeled with the partial reluctance. The method is based on frequency-domain circuit analysis and the technique of vector fitting [14], and obtains the time-domain voltage response at given P/G nodes. The frequency-domain circuit equation including partial reluctances is derived, and then solved with the GMRES algorithm with rescaling, preconditioning and recycling techniques. With the merit of sparsified reluctance matrix and iterative solving techniques for the frequency-domain circuit equations, the proposed method is able to handle large-scale P/G networks with complete inductive modeling. Numerical results show that the proposed method is orders of magnitude faster than HSPICE, several times faster than INDUCTWISE [4], and capable of handling the inductive P/G structures with more than 100, 000 wire segments.

A simple extension of Roe's scheme for real gases

DOE Office of Scientific and Technical Information (OSTI.GOV)

Arabi, Sina, E-mail: sina.arabi@polymtl.ca; Trépanier, Jean-Yves; Camarero, Ricardo

The purpose of this paper is to develop a highly accurate numerical algorithm to model real gas flows in local thermodynamic equilibrium (LTE). The Euler equations are solved using a finite volume method based on Roe's flux difference splitting scheme including real gas effects. A novel algorithm is proposed to calculate the Jacobian matrix which satisfies the flux difference splitting exactly in the average state for a general equation of state. This algorithm increases the robustness and accuracy of the method, especially around the contact discontinuities and shock waves where the gas properties jump appreciably. The results are compared withmore » an exact solution of the Riemann problem for the shock tube which considers the real gas effects. In addition, the method is applied to a blunt cone to illustrate the capability of the proposed extension in solving two dimensional flows.« less

A Strassen-Newton algorithm for high-speed parallelizable matrix inversion

NASA Technical Reports Server (NTRS)

Bailey, David H.; Ferguson, Helaman R. P.

1988-01-01

Techniques are described for computing matrix inverses by algorithms that are highly suited to massively parallel computation. The techniques are based on an algorithm suggested by Strassen (1969). Variations of this scheme use matrix Newton iterations and other methods to improve the numerical stability while at the same time preserving a very high level of parallelism. One-processor Cray-2 implementations of these schemes range from one that is up to 55 percent faster than a conventional library routine to one that is slower than a library routine but achieves excellent numerical stability. The problem of computing the solution to a single set of linear equations is discussed, and it is shown that this problem can also be solved efficiently using these techniques.

Recent results and persisting problems in modeling flow induced coalescence

DOE Office of Scientific and Technical Information (OSTI.GOV)

Fortelný, I., E-mail: fortelny@imc.cas.cz, E-mail: juza@imc.cas.cz; Jza, J., E-mail: fortelny@imc.cas.cz, E-mail: juza@imc.cas.cz

2014-05-15

The contribution summarizes recent results of description of the flow induced coalescence in immiscible polymer blends and addresses problems that call for which solving. The theory of coalescence based on the switch between equations for matrix drainage between spherical or deformed droplets provides a good agreement with more complicated modeling and available experimental data for probability, P{sub c}, that the collision of droplets will be followed by their fusion. A new equation for description of the matrix drainage between deformed droplets, applicable to the whole range of viscosity ratios, p, of the droplets and matrixes, is proposed. The theory facilitatesmore » to consider the effect of the matrix elasticity on coalescence. P{sub c} decreases with the matrix relaxation time but this decrease is not pronounced for relaxation times typical of most commercial polymers. Modeling of the flow induced coalescence in concentrated systems is needed for prediction of the dependence of coalescence rate on volume fraction of droplets. The effect of the droplet anisometry on P{sub c} should be studied for better understanding the coalescence in flow field with high and moderate deformation rates. A reliable description of coalescence in mixing and processing devices requires proper modeling of complex flow fields.« less

Rapid convergence of optimal control in NMR using numerically-constructed toggling frames

NASA Astrophysics Data System (ADS)

Coote, Paul; Anklin, Clemens; Massefski, Walter; Wagner, Gerhard; Arthanari, Haribabu

2017-08-01

We present a numerical method for rapidly solving the Bloch equation for an arbitrary time-varying spin-1/2 Hamiltonian. The method relies on fast, vectorized computations such as summation and quaternion multiplication, rather than slow computations such as matrix exponentiation. A toggling frame is constructed in which the Hamiltonian is time-invariant, and therefore has a simple analytical solution. The key insight is that constructing this frame is faster than solving the system dynamics in the original frame. Rapidly solving the Bloch equations for an arbitrary Hamiltonian is particularly useful in the context of NMR optimal control. Optimal control theory can be used to design pulse shapes for a range of tasks in NMR spectroscopy. However, it requires multiple simulations of the Bloch equations at each stage of the algorithm, and for each relevant set of parameters (e.g. chemical shift frequencies). This is typically time consuming. We demonstrate that by working in an appropriate toggling frame, optimal control pulses can be generated much faster. We present a new alternative to the well-known GRAPE algorithm to continuously update the toggling-frame as the optimal pulse is generated, and demonstrate that this approach is extremely fast. The use and benefit of rapid optimal pulse generation is demonstrated for 19F fragment screening experiments.

Exact solution for four-order acousto-optic Bragg diffraction with arbitrary initial conditions.

PubMed

Pieper, Ron; Koslover, Deborah; Poon, Ting-Chung

2009-03-01

An exact solution to the four-order acousto-optic (AO) Bragg diffraction problem with arbitrary initial conditions compatible with exact Bragg angle incident light is developed. The solution, obtained by solving a 4th-order differential equation, is formalized into a transition matrix operator predicting diffracted light orders at the exit of the AO cell in terms of the same diffracted light orders at the entrance. It is shown that the transition matrix is unitary and that this unitary matrix condition is sufficient to guarantee energy conservation. A comparison of analytical solutions with numerical predictions validates the formalism. Although not directly related to the approach used to obtain the solution, it was discovered that all four generated eigenvalues from the four-order AO differential matrix operator are expressed simply in terms of Euclid's Divine Proportion.

Transfer matrix method for dynamics modeling and independent modal space vibration control design of linear hybrid multibody system

NASA Astrophysics Data System (ADS)

Rong, Bao; Rui, Xiaoting; Lu, Kun; Tao, Ling; Wang, Guoping; Ni, Xiaojun

2018-05-01

In this paper, an efficient method of dynamics modeling and vibration control design of a linear hybrid multibody system (MS) is studied based on the transfer matrix method. The natural vibration characteristics of a linear hybrid MS are solved by using low-order transfer equations. Then, by constructing the brand-new body dynamics equation, augmented operator and augmented eigenvector, the orthogonality of augmented eigenvector of a linear hybrid MS is satisfied, and its state space model expressed in each independent model space is obtained easily. According to this dynamics model, a robust independent modal space-fuzzy controller is designed for vibration control of a general MS, and the genetic optimization of some critical control parameters of fuzzy tuners is also presented. Two illustrative examples are performed, which results show that this method is computationally efficient and with perfect control performance.

An algorithmic approach to solving polynomial equations associated with quantum circuits

NASA Astrophysics Data System (ADS)

Gerdt, V. P.; Zinin, M. V.

2009-12-01

In this paper we present two algorithms for reducing systems of multivariate polynomial equations over the finite field F 2 to the canonical triangular form called lexicographical Gröbner basis. This triangular form is the most appropriate for finding solutions of the system. On the other hand, the system of polynomials over F 2 whose variables also take values in F 2 (Boolean polynomials) completely describes the unitary matrix generated by a quantum circuit. In particular, the matrix itself can be computed by counting the number of solutions (roots) of the associated polynomial system. Thereby, efficient construction of the lexicographical Gröbner bases over F 2 associated with quantum circuits gives a method for computing their circuit matrices that is alternative to the direct numerical method based on linear algebra. We compare our implementation of both algorithms with some other software packages available for computing Gröbner bases over F 2.

Improved Conjugate Gradient Bundle Adjustment of Dunhuang Wall Painting Images

NASA Astrophysics Data System (ADS)

Hu, K.; Huang, X.; You, H.

2017-09-01

Bundle adjustment with additional parameters is identified as a critical step for precise orthoimage generation and 3D reconstruction of Dunhuang wall paintings. Due to the introduction of self-calibration parameters and quasi-planar constraints, the structure of coefficient matrix of the reduced normal equation is banded-bordered, making the solving process of bundle adjustment complex. In this paper, Conjugate Gradient Bundle Adjustment (CGBA) method is deduced by calculus of variations. A preconditioning method based on improved incomplete Cholesky factorization is adopt to reduce the condition number of coefficient matrix, as well as to accelerate the iteration rate of CGBA. Both theoretical analysis and experimental results comparison with conventional method indicate that, the proposed method can effectively conquer the ill-conditioned problem of normal equation and improve the calculation efficiency of bundle adjustment with additional parameters considerably, while maintaining the actual accuracy.

Quasi-periodic Solutions of the Kaup-Kupershmidt Hierarchy

NASA Astrophysics Data System (ADS)

Geng, Xianguo; Wu, Lihua; He, Guoliang

2013-08-01

Based on solving the Lenard recursion equations and the zero-curvature equation, we derive the Kaup-Kupershmidt hierarchy associated with a 3×3 matrix spectral problem. Resorting to the characteristic polynomial of the Lax matrix for the Kaup-Kupershmidt hierarchy, we introduce a trigonal curve {K}_{m-1} and present the corresponding Baker-Akhiezer function and meromorphic function on it. The Abel map is introduced to straighten out the Kaup-Kupershmidt flows. With the aid of the properties of the Baker-Akhiezer function and the meromorphic function and their asymptotic expansions, we arrive at their explicit Riemann theta function representations. The Riemann-Jacobi inversion problem is achieved by comparing the asymptotic expansion of the Baker-Akhiezer function and its Riemann theta function representation, from which quasi-periodic solutions of the entire Kaup-Kupershmidt hierarchy are obtained in terms of the Riemann theta functions.

Computation of Sound Propagation by Boundary Element Method

NASA Technical Reports Server (NTRS)

Guo, Yueping

2005-01-01

This report documents the development of a Boundary Element Method (BEM) code for the computation of sound propagation in uniform mean flows. The basic formulation and implementation follow the standard BEM methodology; the convective wave equation and the boundary conditions on the surfaces of the bodies in the flow are formulated into an integral equation and the method of collocation is used to discretize this equation into a matrix equation to be solved numerically. New features discussed here include the formulation of the additional terms due to the effects of the mean flow and the treatment of the numerical singularities in the implementation by the method of collocation. The effects of mean flows introduce terms in the integral equation that contain the gradients of the unknown, which is undesirable if the gradients are treated as additional unknowns, greatly increasing the sizes of the matrix equation, or if numerical differentiation is used to approximate the gradients, introducing numerical error in the computation. It is shown that these terms can be reformulated in terms of the unknown itself, making the integral equation very similar to the case without mean flows and simple for numerical implementation. To avoid asymptotic analysis in the treatment of numerical singularities in the method of collocation, as is conventionally done, we perform the surface integrations in the integral equation by using sub-triangles so that the field point never coincide with the evaluation points on the surfaces. This simplifies the formulation and greatly facilitates the implementation. To validate the method and the code, three canonic problems are studied. They are respectively the sound scattering by a sphere, the sound reflection by a plate in uniform mean flows and the sound propagation over a hump of irregular shape in uniform flows. The first two have analytical solutions and the third is solved by the method of Computational Aeroacoustics (CAA), all of which are used to compare the BEM solutions. The comparisons show very good agreements and validate the accuracy of the BEM approach implemented here.

High precision computing with charge domain devices and a pseudo-spectral method therefor

NASA Technical Reports Server (NTRS)

Barhen, Jacob (Inventor); Toomarian, Nikzad (Inventor); Fijany, Amir (Inventor); Zak, Michail (Inventor)

1997-01-01

The present invention enhances the bit resolution of a CCD/CID MVM processor by storing each bit of each matrix element as a separate CCD charge packet. The bits of each input vector are separately multiplied by each bit of each matrix element in massive parallelism and the resulting products are combined appropriately to synthesize the correct product. In another aspect of the invention, such arrays are employed in a pseudo-spectral method of the invention, in which partial differential equations are solved by expressing each derivative analytically as matrices, and the state function is updated at each computation cycle by multiplying it by the matrices. The matrices are treated as synaptic arrays of a neural network and the state function vector elements are treated as neurons. In a further aspect of the invention, moving target detection is performed by driving the soliton equation with a vector of detector outputs. The neural architecture consists of two synaptic arrays corresponding to the two differential terms of the soliton-equation and an adder connected to the output thereof and to the output of the detector array to drive the soliton equation.

Unsteady Flow Simulation: A Numerical Challenge

DTIC Science & Technology

2003-03-01

drive to convergence the numerical unsteady term. The time marching procedure is based on the approximate implicit Newton method for systems of non...computed through analytical derivatives of S. The linear system stemming from equation (3) is solved at each integration step by the same iterative method...significant reduction of memory usage, thanks to the reduced dimensions of the linear system matrix during the implicit marching of the solution. The

Wavelet-based analysis of transient electromagnetic wave propagation in photonic crystals.

PubMed

Shifman, Yair; Leviatan, Yehuda

2004-03-01

Photonic crystals and optical bandgap structures, which facilitate high-precision control of electromagnetic-field propagation, are gaining ever-increasing attention in both scientific and commercial applications. One common photonic device is the distributed Bragg reflector (DBR), which exhibits high reflectivity at certain frequencies. Analysis of the transient interaction of an electromagnetic pulse with such a device can be formulated in terms of the time-domain volume integral equation and, in turn, solved numerically with the method of moments. Owing to the frequency-dependent reflectivity of such devices, the extent of field penetration into deep layers of the device will be different depending on the frequency content of the impinging pulse. We show how this phenomenon can be exploited to reduce the number of basis functions needed for the solution. To this end, we use spatiotemporal wavelet basis functions, which possess the multiresolution property in both spatial and temporal domains. To select the dominant functions in the solution, we use an iterative impedance matrix compression (IMC) procedure, which gradually constructs and solves a compressed version of the matrix equation until the desired degree of accuracy has been achieved. Results show that when the electromagnetic pulse is reflected, the transient IMC omits basis functions defined over the last layers of the DBR, as anticipated.

AZTEC. Parallel Iterative method Software for Solving Linear Systems

DOE Office of Scientific and Technical Information (OSTI.GOV)

Hutchinson, S.; Shadid, J.; Tuminaro, R.

1995-07-01

AZTEC is an interactive library that greatly simplifies the parrallelization process when solving the linear systems of equations Ax=b where A is a user supplied n X n sparse matrix, b is a user supplied vector of length n and x is a vector of length n to be computed. AZTEC is intended as a software tool for users who want to avoid cumbersome parallel programming details but who have large sparse linear systems which require an efficiently utilized parallel processing system. A collection of data transformation tools are provided that allow for easy creation of distributed sparse unstructured matricesmore » for parallel solutions.« less

Grid adaption for hypersonic flow

NASA Technical Reports Server (NTRS)

Abolhassani, Jamshid S.; Tiwari, Surendra N.; Smith, Robert E.

1987-01-01

The methods of grid adaption are reviewed and a method is developed with the capability of adaption to several flow variables. This method is based on a variational approach and is an algebraic method which does not require the solution of partial differential equations. Also the method has been formulated in such a way that there is no need for any matrix inversion. The method is used in conjunction with the calculation of hypersonic flow over a blunt nose body. The equations of motion are the compressible Navier-Stokes equations where all viscous terms are retained. They are solved by the MacCormack time-splitting method. A movie has been produced which shows simultaneously the transient behavior of the solution and the grid adaption.

A fast direct method for block triangular Toeplitz-like with tri-diagonal block systems from time-fractional partial differential equations

NASA Astrophysics Data System (ADS)

Ke, Rihuan; Ng, Michael K.; Sun, Hai-Wei

2015-12-01

In this paper, we study the block lower triangular Toeplitz-like with tri-diagonal blocks system which arises from the time-fractional partial differential equation. Existing fast numerical solver (e.g., fast approximate inversion method) cannot handle such linear system as the main diagonal blocks are different. The main contribution of this paper is to propose a fast direct method for solving this linear system, and to illustrate that the proposed method is much faster than the classical block forward substitution method for solving this linear system. Our idea is based on the divide-and-conquer strategy and together with the fast Fourier transforms for calculating Toeplitz matrix-vector multiplication. The complexity needs O (MNlog2 ⁡ M) arithmetic operations, where M is the number of blocks (the number of time steps) in the system and N is the size (number of spatial grid points) of each block. Numerical examples from the finite difference discretization of time-fractional partial differential equations are also given to demonstrate the efficiency of the proposed method.

Improved Filon-type asymptotic methods for highly oscillatory differential equations with multiple time scales

NASA Astrophysics Data System (ADS)

Wang, Bin; Wu, Xinyuan

2014-11-01

In this paper we consider multi-frequency highly oscillatory second-order differential equations x″ (t) + Mx (t) = f (t , x (t) ,x‧ (t)) where high-frequency oscillations are generated by the linear part Mx (t), and M is positive semi-definite (not necessarily nonsingular). It is known that Filon-type methods are effective approach to numerically solving highly oscillatory problems. Unfortunately, however, existing Filon-type asymptotic methods fail to apply to the highly oscillatory second-order differential equations when M is singular. We study and propose an efficient improvement on the existing Filon-type asymptotic methods, so that the improved Filon-type asymptotic methods can be able to numerically solving this class of multi-frequency highly oscillatory systems with a singular matrix M. The improved Filon-type asymptotic methods are designed by combining Filon-type methods with the asymptotic methods based on the variation-of-constants formula. We also present one efficient and practical improved Filon-type asymptotic method which can be performed at lower cost. Accompanying numerical results show the remarkable efficiency.

A least-squares finite element method for 3D incompressible Navier-Stokes equations

NASA Technical Reports Server (NTRS)

Jiang, Bo-Nan; Lin, T. L.; Hou, Lin-Jun; Povinelli, Louis A.

1993-01-01

The least-squares finite element method (LSFEM) based on the velocity-pressure-vorticity formulation is applied to three-dimensional steady incompressible Navier-Stokes problems. This method can accommodate equal-order interpolations, and results in symmetric, positive definite algebraic system. An additional compatibility equation, i.e., the divergence of vorticity vector should be zero, is included to make the first-order system elliptic. The Newton's method is employed to linearize the partial differential equations, the LSFEM is used to obtain discretized equations, and the system of algebraic equations is solved using the Jacobi preconditioned conjugate gradient method which avoids formation of either element or global matrices (matrix-free) to achieve high efficiency. The flow in a half of 3D cubic cavity is calculated at Re = 100, 400, and 1,000 with 50 x 52 x 25 trilinear elements. The Taylor-Gortler-like vortices are observed at Re = 1,000.

Kinematic equations for control of the redundant eight-degree-of-freedom advanced research manipulator 2

NASA Technical Reports Server (NTRS)

Williams, Robert L., II

1992-01-01

The forward position and velocity kinematics for the redundant eight-degree-of-freedom Advanced Research Manipulator 2 (ARM2) are presented. Inverse position and velocity kinematic solutions are also presented. The approach in this paper is to specify two of the unknowns and solve for the remaining six unknowns. Two unknowns can be specified with two restrictions. First, the elbow joint angle and rate cannot be specified because they are known from the end-effector position and velocity. Second, one unknown must be specified from the four-jointed wrist, and the second from joints that translate the wrist, elbow joint excluded. There are eight solutions to the inverse position problem. The inverse velocity solution is unique, assuming the Jacobian matrix is not singular. A discussion of singularities is based on specifying two joint rates and analyzing the reduced Jacobian matrix. When this matrix is singular, the generalized inverse may be used as an alternate solution. Computer simulations were developed to verify the equations. Examples demonstrate agreement between forward and inverse solutions.

An ESS maximum principle for matrix games.

PubMed

Vincent, T L; Cressman, R

2000-11-01

Previous work has demonstrated that for games defined by differential or difference equations with a continuum of strategies, there exists a G-function, related to individual fitness, that must take on a maximum with respect to a virtual variable v whenever v is one of the vectors in the coalition of vectors which make up the evolutionarily stable strategy (ESS). This result, called the ESS maximum principle, is quite useful in determining candidates for an ESS. This principle is reformulated here, so that it may be conveniently applied to matrix games. In particular, we define a matrix game to be one in which fitness is expressed in terms of strategy frequencies and a matrix of expected payoffs. It is shown that the G-function in the matrix game setting must again take on a maximum value at all the strategies which make up the ESS coalition vector. The reformulated maximum principle is applicable to both bilinear and nonlinear matrix games. One advantage in employing this principle to solve the traditional bilinear matrix game is that the same G-function is used to find both pure and mixed strategy solutions by simply specifying an appropriate strategy space. Furthermore we show how the theory may be used to solve matrix games which are not in the usual bilinear form. We examine in detail two nonlinear matrix games: the game between relatives and the sex ratio game. In both of these games an ESS solution is determined. These examples not only illustrate the usefulness of this approach to finding solutions to an expanded class of matrix games, but aids in understanding the nature of the ESS as well.

Numerical Solution of Systems of Loaded Ordinary Differential Equations with Multipoint Conditions

NASA Astrophysics Data System (ADS)

Assanova, A. T.; Imanchiyev, A. E.; Kadirbayeva, Zh. M.

2018-04-01

A system of loaded ordinary differential equations with multipoint conditions is considered. The problem under study is reduced to an equivalent boundary value problem for a system of ordinary differential equations with parameters. A system of linear algebraic equations for the parameters is constructed using the matrices of the loaded terms and the multipoint condition. The conditions for the unique solvability and well-posedness of the original problem are established in terms of the matrix made up of the coefficients of the system of linear algebraic equations. The coefficients and the righthand side of the constructed system are determined by solving Cauchy problems for linear ordinary differential equations. The solutions of the system are found in terms of the values of the desired function at the initial points of subintervals. The parametrization method is numerically implemented using the fourth-order accurate Runge-Kutta method as applied to the Cauchy problems for ordinary differential equations. The performance of the constructed numerical algorithms is illustrated by examples.

The FEM-R-Matrix Approach: Use of Mixed Finite Element and Gaussian Basis Sets for Electron Molecule Collisions

NASA Technical Reports Server (NTRS)

Thuemmel, Helmar T.; Huo, Winifred M.; Langhoff, Stephen R. (Technical Monitor)

1995-01-01

For the calculation of electron molecule collision cross sections R-matrix methods automatically take advantage of the division of configuration space into an inner region (I) bounded by radius tau b, where the scattered electron is within the molecular charge cloud and the system is described by an correlated Configuration Interaction (CI) treatment in close analogy to bound state calculations, and an outer region (II) where the scattered electron moves in the long-range multipole potential of the target and efficient analytic methods can be used for solving the asymptotic Schroedinger equation plus boundary conditions.

Electromagnetic scattering of large structures in layered earths using integral equations

NASA Astrophysics Data System (ADS)

Xiong, Zonghou; Tripp, Alan C.

1995-07-01

An electromagnetic scattering algorithm for large conductivity structures in stratified media has been developed and is based on the method of system iteration and spatial symmetry reduction using volume electric integral equations. The method of system iteration divides a structure into many substructures and solves the resulting matrix equation using a block iterative method. The block submatrices usually need to be stored on disk in order to save computer core memory. However, this requires a large disk for large structures. If the body is discretized into equal-size cells it is possible to use the spatial symmetry relations of the Green's functions to regenerate the scattering impedance matrix in each iteration, thus avoiding expensive disk storage. Numerical tests show that the system iteration converges much faster than the conventional point-wise Gauss-Seidel iterative method. The numbers of cells do not significantly affect the rate of convergency. Thus the algorithm effectively reduces the solution of the scattering problem to an order of O(N2), instead of O(N3) as with direct solvers.

A Riemann-Hilbert formulation for the finite temperature Hubbard model

NASA Astrophysics Data System (ADS)

Cavaglià, Andrea; Cornagliotto, Martina; Mattelliano, Massimo; Tateo, Roberto

2015-06-01

Inspired by recent results in the context of AdS/CFT integrability, we reconsider the Thermodynamic Bethe Ansatz equations describing the 1D fermionic Hubbard model at finite temperature. We prove that the infinite set of TBA equations are equivalent to a simple nonlinear Riemann-Hilbert problem for a finite number of unknown functions. The latter can be transformed into a set of three coupled nonlinear integral equations defined over a finite support, which can be easily solved numerically. We discuss the emergence of an exact Bethe Ansatz and the link between the TBA approach and the results by Jüttner, Klümper and Suzuki based on the Quantum Transfer Matrix method. We also comment on the analytic continuation mechanism leading to excited states and on the mirror equations describing the finite-size Hubbard model with twisted boundary conditions.

Algebraic geometry and Bethe ansatz. Part I. The quotient ring for BAE

NASA Astrophysics Data System (ADS)

Jiang, Yunfeng; Zhang, Yang

2018-03-01

In this paper and upcoming ones, we initiate a systematic study of Bethe ansatz equations for integrable models by modern computational algebraic geometry. We show that algebraic geometry provides a natural mathematical language and powerful tools for understanding the structure of solution space of Bethe ansatz equations. In particular, we find novel efficient methods to count the number of solutions of Bethe ansatz equations based on Gröbner basis and quotient ring. We also develop analytical approach based on companion matrix to perform the sum of on-shell quantities over all physical solutions without solving Bethe ansatz equations explicitly. To demonstrate the power of our method, we revisit the completeness problem of Bethe ansatz of Heisenberg spin chain, and calculate the sum rules of OPE coefficients in planar N=4 super-Yang-Mills theory.

Multi-color incomplete Cholesky conjugate gradient methods for vector computers. Ph.D. Thesis

NASA Technical Reports Server (NTRS)

Poole, E. L.

1986-01-01

In this research, we are concerned with the solution on vector computers of linear systems of equations, Ax = b, where A is a larger, sparse symmetric positive definite matrix. We solve the system using an iterative method, the incomplete Cholesky conjugate gradient method (ICCG). We apply a multi-color strategy to obtain p-color matrices for which a block-oriented ICCG method is implemented on the CYBER 205. (A p-colored matrix is a matrix which can be partitioned into a pXp block matrix where the diagonal blocks are diagonal matrices). This algorithm, which is based on a no-fill strategy, achieves O(N/p) length vector operations in both the decomposition of A and in the forward and back solves necessary at each iteration of the method. We discuss the natural ordering of the unknowns as an ordering that minimizes the number of diagonals in the matrix and define multi-color orderings in terms of disjoint sets of the unknowns. We give necessary and sufficient conditions to determine which multi-color orderings of the unknowns correpond to p-color matrices. A performance model is given which is used both to predict execution time for ICCG methods and also to compare an ICCG method to conjugate gradient without preconditioning or another ICCG method. Results are given from runs on the CYBER 205 at NASA's Langley Research Center for four model problems.

Linear and nonlinear dynamic analysis of redundant load path bearingless rotor systems

NASA Technical Reports Server (NTRS)

Murthy, V. R.; Shultz, Louis A.

1994-01-01

The goal of this research is to develop the transfer matrix method to treat nonlinear autonomous boundary value problems with multiple branches. The application is the complete nonlinear aeroelastic analysis of multiple-branched rotor blades. Once the development is complete, it can be incorporated into the existing transfer matrix analyses. There are several difficulties to be overcome in reaching this objective. The conventional transfer matrix method is limited in that it is applicable only to linear branch chain-like structures, but consideration of multiple branch modeling is important for bearingless rotors. Also, hingeless and bearingless rotor blade dynamic characteristics (particularly their aeroelasticity problems) are inherently nonlinear. The nonlinear equations of motion and the multiple-branched boundary value problem are treated together using a direct transfer matrix method. First, the formulation is applied to a nonlinear single-branch blade to validate the nonlinear portion of the formulation. The nonlinear system of equations is iteratively solved using a form of Newton-Raphson iteration scheme developed for differential equations of continuous systems. The formulation is then applied to determine the nonlinear steady state trim and aeroelastic stability of a rotor blade in hover with two branches at the root. A comprehensive computer program is developed and is used to obtain numerical results for the (1) free vibration, (2) nonlinearly deformed steady state, (3) free vibration about the nonlinearly deformed steady state, and (4) aeroelastic stability tasks. The numerical results obtained by the present method agree with results from other methods.

MSC/NASTRAN DMAP Alter Used for Closed-Form Static Analysis With Inertia Relief and Displacement-Dependent Loads

NASA Technical Reports Server (NTRS)

1996-01-01

Solving for the displacements of free-free coupled systems acted upon by static loads is a common task in the aerospace industry. Often, these problems are solved by static analysis with inertia relief. This technique allows for a free-free static analysis by balancing the applied loads with the inertia loads generated by the applied loads. For some engineering applications, the displacements of the free-free coupled system induce additional static loads. Hence, the applied loads are equal to the original loads plus the displacement-dependent loads. A launch vehicle being acted upon by an aerodynamic loading can have such applied loads. The final displacements of such systems are commonly determined with iterative solution techniques. Unfortunately, these techniques can be time consuming and labor intensive. Because the coupled system equations for free-free systems with displacement-dependent loads can be written in closed form, it is advantageous to solve for the displacements in this manner. Implementing closed-form equations in static analysis with inertia relief is analogous to implementing transfer functions in dynamic analysis. An MSC/NASTRAN (MacNeal-Schwendler Corporation/NASA Structural Analysis) DMAP (Direct Matrix Abstraction Program) Alter was used to include displacement-dependent loads in static analysis with inertia relief. It efficiently solved a common aerospace problem that typically has been solved with an iterative technique.

Solute Migration from the Aquifer Matrix into a Solution Conduit and the Reverse.

PubMed

Li, Guangquan; Field, Malcolm S

2016-09-01

A solution conduit has a permeable wall allowing for water exchange and solute transfer between the conduit and its surrounding aquifer matrix. In this paper, we use Laplace Transform to solve a one-dimensional equation constructed using the Euler approach to describe advective transport of solute in a conduit, a production-value problem. Both nonuniform cross-section of the conduit and nonuniform seepage at the conduit wall are considered in the solution. Physical analysis using the Lagrangian approach and a lumping method is performed to verify the solution. Two-way transfer between conduit water and matrix water is also investigated by using the solution for the production-value problem as a first-order approximation. The approximate solution agrees well with the exact solution if dimensionless travel time in the conduit is an order of magnitude smaller than unity. Our analytical solution is based on the assumption that the spatial and/or temporal heterogeneity in the wall solute flux is the dominant factor in the spreading of spring-breakthrough curves, and conduit dispersion is only a secondary mechanism. Such an approach can lead to the better understanding of water exchange and solute transfer between conduits and aquifer matrix. Euler and Lagrangian approaches are used to solve transport in conduit. Two-way transfer between conduit and matrix is investigated. The solution is applicable to transport in conduit of persisting solute from matrix. © 2016, National Ground Water Association.

Flapping response characteristics of hingeless rotor blades by a gereralized harmonic balance method

NASA Technical Reports Server (NTRS)

Peters, D. A.; Ormiston, R. A.

1975-01-01

Linearized equations of motion for the flapping response of flexible rotor blades in forward flight are derived in terms of generalized coordinates. The equations are solved using a matrix form of the method of linear harmonic balance, yielding response derivatives for each harmonic of the blade deformations and of the hub forces and moments. Numerical results and approximate closed-form expressions for rotor derivatives are used to illustrate the relationships between rotor parameters, modeling assumptions, and rotor response characteristics. Finally, basic hingeless rotor response derivatives are presented in tabular and graphical form for a wide range of configuration parameters and operating conditions.

Double diffusion in arbitrary porous cavity: Part II

NASA Astrophysics Data System (ADS)

Ahamad, N. Ameer; Kamangar, Sarfaraz; Salman Ahmed N., J.; Soudagar, Manzoor Elahi M.; Khan, T. M. Yunus

2017-07-01

Heat and mass transfer in porous medium is one of the fundamental topics of interest. The present article is dedicated to study the effect of a small block placed at center of left vertical surface of the cavity. The block is maintained at isothermal temperature That three of its edges attached with porous medium. The left surface of cavity is maintained at highest concentration and right surface at lowest concentration. The right surface of cavity is at cold isothermal temperature Tc. Governing equations are converted into matrix form of equations with the help of finite element method and solved iteratively by using a computer code generated in MATLAB.

Three-Loop Automatic of Control System the Landfill of Household Solid Waste

NASA Astrophysics Data System (ADS)

Sereda, T. G.; Kostarev, S. N.

2017-05-01

The analysis of models of governance ground municipal solid waste (MSW). Considered a distributed circuit (spatio-temporal) ground control model. Developed a dynamic model of multicontour control landfill. Adjustable parameters are defined (the ratio of CH4 CO2 emission/fluxes, concentrations of heavy metals ions) and control (purging array, irrigation, adding reagents). Based on laboratory studies carried out with the analysis of equity flows and procedures developed by the transferring matrix that takes into account the relationship control loops. A system of differential equations in the frequency and time domains. Given the numerical approaches solving systems of differential equations in finite differential form.

Aerothermodynamic shape optimization of hypersonic blunt bodies

NASA Astrophysics Data System (ADS)

Eyi, Sinan; Yumuşak, Mine

2015-07-01

The aim of this study is to develop a reliable and efficient design tool that can be used in hypersonic flows. The flow analysis is based on the axisymmetric Euler/Navier-Stokes and finite-rate chemical reaction equations. The equations are coupled simultaneously and solved implicitly using Newton's method. The Jacobian matrix is evaluated analytically. A gradient-based numerical optimization is used. The adjoint method is utilized for sensitivity calculations. The objective of the design is to generate a hypersonic blunt geometry that produces the minimum drag with low aerodynamic heating. Bezier curves are used for geometry parameterization. The performances of the design optimization method are demonstrated for different hypersonic flow conditions.

A nonperturbative light-front coupled-cluster method

NASA Astrophysics Data System (ADS)

Hiller, J. R.

2012-10-01

The nonperturbative Hamiltonian eigenvalue problem for bound states of a quantum field theory is formulated in terms of Dirac's light-front coordinates and then approximated by the exponential-operator technique of the many-body coupled-cluster method. This approximation eliminates any need for the usual approximation of Fock-space truncation. Instead, the exponentiated operator is truncated, and the terms retained are determined by a set of nonlinear integral equations. These equations are solved simultaneously with an effective eigenvalue problem in the valence sector, where the number of constituents is small. Matrix elements can be calculated, with extensions of techniques from standard coupled-cluster theory, to obtain form factors and other observables.

Duality in left-right symmetric seesaw mechanism.

PubMed

Akhmedov, E Kh; Frigerio, M

2006-02-17

We consider type I + II seesaw mechanism, where the exchanges of both right-handed neutrinos and isotriplet Higgs bosons contribute to the neutrino mass. Working in the left-right symmetric framework and assuming the mass matrix of light neutrinos m(v) and the Dirac-type Yukawa couplings to be known, we find the triplet Yukawa coupling matrix f, which carries the information about the masses and mixing of the right-handed neutrinos. We show that in this case there exists a duality: for any solution f, there is a dual solution [symbol: see text] = m(v)/nu(L) - f, where nu(L) is the vacuum expectation value of the triplet Higgs boson. Thus, unlike in pure type I (II) seesaw, there is no unique allowed structure for the matrix f. For n lepton generations the number of solutions is 2(n). We develop an exact analytic method of solving the seesaw nonlinear matrix equation for f.

Sparse matrix-vector multiplication on network-on-chip

NASA Astrophysics Data System (ADS)

Sun, C.-C.; Götze, J.; Jheng, H.-Y.; Ruan, S.-J.

2010-12-01

In this paper, we present an idea for performing matrix-vector multiplication by using Network-on-Chip (NoC) architecture. In traditional IC design on-chip communications have been designed with dedicated point-to-point interconnections. Therefore, regular local data transfer is the major concept of many parallel implementations. However, when dealing with the parallel implementation of sparse matrix-vector multiplication (SMVM), which is the main step of all iterative algorithms for solving systems of linear equation, the required data transfers depend on the sparsity structure of the matrix and can be extremely irregular. Using the NoC architecture makes it possible to deal with arbitrary structure of the data transfers; i.e. with the irregular structure of the sparse matrices. So far, we have already implemented the proposed SMVM-NoC architecture with the size 4×4 and 5×5 in IEEE 754 single float point precision using FPGA.

Closed form solution for a double quantum well using Gröbner basis

NASA Astrophysics Data System (ADS)

Acus, A.; Dargys, A.

2011-07-01

Analytical expressions for the spectrum, eigenfunctions and dipole matrix elements of a square double quantum well (DQW) are presented for a general case when the potential in different regions of the DQW has different heights and the effective masses are different. This was achieved by using a Gröbner basis algorithm that allowed us to disentangle the resulting coupled polynomials without explicitly solving the transcendental eigenvalue equation.

KANTBP 2.0: New version of a program for computing energy levels, reaction matrix and radial wave functions in the coupled-channel hyperspherical adiabatic approach

NASA Astrophysics Data System (ADS)

Chuluunbaatar, O.; Gusev, A. A.; Vinitsky, S. I.; Abrashkevich, A. G.

2008-11-01

A FORTRAN 77 program for calculating energy values, reaction matrix and corresponding radial wave functions in a coupled-channel approximation of the hyperspherical adiabatic approach is presented. In this approach, a multi-dimensional Schrödinger equation is reduced to a system of the coupled second-order ordinary differential equations on a finite interval with homogeneous boundary conditions: (i) the Dirichlet, Neumann and third type at the left and right boundary points for continuous spectrum problem, (ii) the Dirichlet and Neumann type conditions at left boundary point and Dirichlet, Neumann and third type at the right boundary point for the discrete spectrum problem. The resulting system of radial equations containing the potential matrix elements and first-derivative coupling terms is solved using high-order accuracy approximations of the finite element method. As a test desk, the program is applied to the calculation of the reaction matrix and radial wave functions for 3D-model of a hydrogen-like atom in a homogeneous magnetic field. This version extends the previous version 1.0 of the KANTBP program [O. Chuluunbaatar, A.A. Gusev, A.G. Abrashkevich, A. Amaya-Tapia, M.S. Kaschiev, S.Y. Larsen, S.I. Vinitsky, Comput. Phys. Commun. 177 (2007) 649-675]. Program summaryProgram title: KANTBP Catalogue identifier: ADZH_v2_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/ADZH_v2_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.html No. of lines in distributed program, including test data, etc.: 20 403 No. of bytes in distributed program, including test data, etc.: 147 563 Distribution format: tar.gz Programming language: FORTRAN 77 Computer: Intel Xeon EM64T, Alpha 21264A, AMD Athlon MP, Pentium IV Xeon, Opteron 248, Intel Pentium IV Operating system: OC Linux, Unix AIX 5.3, SunOS 5.8, Solaris, Windows XP RAM: This depends on the number of differential equations; the number and order of finite elements; the number of hyperradial points; and the number of eigensolutions required. The test run requires 2 MB Classification: 2.1, 2.4 External routines: GAULEG and GAUSSJ [2] Nature of problem: In the hyperspherical adiabatic approach [3-5], a multidimensional Schrödinger equation for a two-electron system [6] or a hydrogen atom in magnetic field [7-9] is reduced by separating radial coordinate ρ from the angular variables to a system of the second-order ordinary differential equations containing the potential matrix elements and first-derivative coupling terms. The purpose of this paper is to present the finite element method procedure based on the use of high-order accuracy approximations for calculating approximate eigensolutions of the continuum spectrum for such systems of coupled differential equations on finite intervals of the radial variable ρ∈[ρ,ρ]. This approach can be used in the calculations of effects of electron screening on low-energy fusion cross sections [10-12]. Solution method: The boundary problems for the coupled second-order differential equations are solved by the finite element method using high-order accuracy approximations [13]. The generalized algebraic eigenvalue problem AF=EBF with respect to pair unknowns ( E,F) arising after the replacement of the differential problem by the finite-element approximation is solved by the subspace iteration method using the SSPACE program [14]. The generalized algebraic eigenvalue problem (A-EB)F=λDF with respect to pair unknowns ( λ,F) arising after the corresponding replacement of the scattering boundary problem in open channels at fixed energy value, E, is solved by the LDL factorization of symmetric matrix and back-substitution methods using the DECOMP and REDBAK programs, respectively [14]. As a test desk, the program is applied to the calculation of the reaction matrix and corresponding radial wave functions for 3D-model of a hydrogen-like atom in a homogeneous magnetic field described in [9] on finite intervals of the radial variable ρ∈[ρ,ρ]. For this benchmark model the required analytical expressions for asymptotics of the potential matrix elements and first-derivative coupling terms, and also asymptotics of radial solutions of the boundary problems for coupled differential equations have been produced with help of a MAPLE computer algebra system. Restrictions: The computer memory requirements depend on: the number of differential equations; the number and order of finite elements; the total number of hyperradial points; and the number of eigensolutions required. Restrictions due to dimension sizes may be easily alleviated by altering PARAMETER statements (see Section 3 and [1] for details). The user must also supply subroutine POTCAL for evaluating potential matrix elements. The user should also supply subroutines ASYMEV (when solving the eigenvalue problem) or ASYMS0 and ASYMSC (when solving the scattering problem) which evaluate asymptotics of the radial wave functions at left and right boundary points in case of a boundary condition of the third type for the above problems. Running time: The running time depends critically upon: the number of differential equations; the number and order of finite elements; the total number of hyperradial points on interval [ ρ,ρ]; and the number of eigensolutions required. The test run which accompanies this paper took 2 s without calculation of matrix potentials on the Intel Pentium IV 2.4 GHz. References: [1] O. Chuluunbaatar, A.A. Gusev, A.G. Abrashkevich, A. Amaya-Tapia, M.S. Kaschiev, S.Y. Larsen, S.I. Vinitsky, Comput. Phys. Commun. 177 (2007) 649-675; http://cpc.cs.qub.ac.uk/summaries/ADZHv10.html. [2] W.H. Press, S.A. Teukolsky, W.T. Vetterling, B.P. Flannery, Numerical Recipes: The Art of Scientific Computing, Cambridge University Press, Cambridge, 1986. [3] J. Macek, J. Phys. B 1 (1968) 831-843. [4] U. Fano, Rep. Progr. Phys. 46 (1983) 97-165. [5] C.D. Lin, Adv. Atom. Mol. Phys. 22 (1986) 77-142. [6] A.G. Abrashkevich, D.G. Abrashkevich, M. Shapiro, Comput. Phys. Commun. 90 (1995) 311-339. [7] M.G. Dimova, M.S. Kaschiev, S.I. Vinitsky, J. Phys. B 38 (2005) 2337-2352. [8] O. Chuluunbaatar, A.A. Gusev, V.L. Derbov, M.S. Kaschiev, L.A. Melnikov, V.V. Serov, S.I. Vinitsky, J. Phys. A 40 (2007) 11485-11524. [9] O. Chuluunbaatar, A.A. Gusev, V.P. Gerdt, V.A. Rostovtsev, S.I. Vinitsky, A.G. Abrashkevich, M.S. Kaschiev, V.V. Serov, Comput. Phys. Commun. 178 (2007) 301 330; http://cpc.cs.qub.ac.uk/summaries/AEAAv10.html. [10] H.J. Assenbaum, K. Langanke, C. Rolfs, Z. Phys. A 327 (1987) 461-468. [11] V. Melezhik, Nucl. Phys. A 550 (1992) 223-234. [12] L. Bracci, G. Fiorentini, V.S. Melezhik, G. Mezzorani, P. Pasini, Phys. Lett. A 153 (1991) 456-460. [13] A.G. Abrashkevich, D.G. Abrashkevich, M.S. Kaschiev, I.V. Puzynin, Comput. Phys. Commun. 85 (1995) 40-64. [14] K.J. Bathe, Finite Element Procedures in Engineering Analysis, Englewood Cliffs, Prentice-Hall, New York, 1982.

Oxidation Behavior of Carbon Fiber-Reinforced Composites

NASA Technical Reports Server (NTRS)

Sullivan, Roy M.

2008-01-01

OXIMAP is a numerical (FEA-based) solution tool capable of calculating the carbon fiber and fiber coating oxidation patterns within any arbitrarily shaped carbon silicon carbide composite structure as a function of time, temperature, and the environmental oxygen partial pressure. The mathematical formulation is derived from the mechanics of the flow of ideal gases through a chemically reacting, porous solid. The result of the formulation is a set of two coupled, non-linear differential equations written in terms of the oxidant and oxide partial pressures. The differential equations are solved simultaneously to obtain the partial vapor pressures of the oxidant and oxides as a function of the spatial location and time. The local rate of carbon oxidation is determined at each time step using the map of the local oxidant partial vapor pressure along with the Arrhenius rate equation. The non-linear differential equations are cast into matrix equations by applying the Bubnov-Galerkin weighted residual finite element method, allowing for the solution of the differential equations numerically.

A formulation of rotor-airframe coupling for design analysis of vibrations of helicopter airframes

NASA Technical Reports Server (NTRS)

Kvaternik, R. G.; Walton, W. C., Jr.

1982-01-01

A linear formulation of rotor airframe coupling intended for vibration analysis in airframe structural design is presented. The airframe is represented by a finite element analysis model; the rotor is represented by a general set of linear differential equations with periodic coefficients; and the connections between the rotor and airframe are specified through general linear equations of constraint. Coupling equations are applied to the rotor and airframe equations to produce one set of linear differential equations governing vibrations of the combined rotor airframe system. These equations are solved by the harmonic balance method for the system steady state vibrations. A feature of the solution process is the representation of the airframe in terms of forced responses calculated at the rotor harmonics of interest. A method based on matrix partitioning is worked out for quick recalculations of vibrations in design studies when only relatively few airframe members are varied. All relations are presented in forms suitable for direct computer implementation.

A high-order spatial filter for a cubed-sphere spectral element model

NASA Astrophysics Data System (ADS)

Kang, Hyun-Gyu; Cheong, Hyeong-Bin

2017-04-01

A high-order spatial filter is developed for the spectral-element-method dynamical core on the cubed-sphere grid which employs the Gauss-Lobatto Lagrange interpolating polynomials (GLLIP) as orthogonal basis functions. The filter equation is the high-order Helmholtz equation which corresponds to the implicit time-differencing of a diffusion equation employing the high-order Laplacian. The Laplacian operator is discretized within a cell which is a building block of the cubed sphere grid and consists of the Gauss-Lobatto grid. When discretizing a high-order Laplacian, due to the requirement of C0 continuity along the cell boundaries the grid-points in neighboring cells should be used for the target cell: The number of neighboring cells is nearly quadratically proportional to the filter order. Discrete Helmholtz equation yields a huge-sized and highly sparse matrix equation whose size is N*N with N the number of total grid points on the globe. The number of nonzero entries is also almost in quadratic proportion to the filter order. Filtering is accomplished by solving the huge-matrix equation. While requiring a significant computing time, the solution of global matrix provides the filtered field free of discontinuity along the cell boundaries. To achieve the computational efficiency and the accuracy at the same time, the solution of the matrix equation was obtained by only accounting for the finite number of adjacent cells. This is called as a local-domain filter. It was shown that to remove the numerical noise near the grid-scale, inclusion of 5*5 cells for the local-domain filter was found sufficient, giving the same accuracy as that obtained by global domain solution while reducing the computing time to a considerably lower level. The high-order filter was evaluated using the standard test cases including the baroclinic instability of the zonal flow. Results indicated that the filter performs better on the removal of grid-scale numerical noises than the explicit high-order viscosity. It was also presented that the filter can be easily implemented on the distributed-memory parallel computers with a desirable scalability.

Multigrid Methods for Fully Implicit Oil Reservoir Simulation

NASA Technical Reports Server (NTRS)

Molenaar, J.

1996-01-01

In this paper we consider the simultaneous flow of oil and water in reservoir rock. This displacement process is modeled by two basic equations: the material balance or continuity equations and the equation of motion (Darcy's law). For the numerical solution of this system of nonlinear partial differential equations there are two approaches: the fully implicit or simultaneous solution method and the sequential solution method. In the sequential solution method the system of partial differential equations is manipulated to give an elliptic pressure equation and a hyperbolic (or parabolic) saturation equation. In the IMPES approach the pressure equation is first solved, using values for the saturation from the previous time level. Next the saturations are updated by some explicit time stepping method; this implies that the method is only conditionally stable. For the numerical solution of the linear, elliptic pressure equation multigrid methods have become an accepted technique. On the other hand, the fully implicit method is unconditionally stable, but it has the disadvantage that in every time step a large system of nonlinear algebraic equations has to be solved. The most time-consuming part of any fully implicit reservoir simulator is the solution of this large system of equations. Usually this is done by Newton's method. The resulting systems of linear equations are then either solved by a direct method or by some conjugate gradient type method. In this paper we consider the possibility of applying multigrid methods for the iterative solution of the systems of nonlinear equations. There are two ways of using multigrid for this job: either we use a nonlinear multigrid method or we use a linear multigrid method to deal with the linear systems that arise in Newton's method. So far only a few authors have reported on the use of multigrid methods for fully implicit simulations. Two-level FAS algorithm is presented for the black-oil equations, and linear multigrid for two-phase flow problems with strong heterogeneities and anisotropies is studied. Here we consider both possibilities. Moreover we present a novel way for constructing the coarse grid correction operator in linear multigrid algorithms. This approach has the advantage in that it preserves the sparsity pattern of the fine grid matrix and it can be extended to systems of equations in a straightforward manner. We compare the linear and nonlinear multigrid algorithms by means of a numerical experiment.

Unsteady solute-transport simulation in streamflow using a finite-difference model

USGS Publications Warehouse

Land, Larry F.

1978-01-01

This report documents a rather simple, general purpose, one-dimensional, one-parameter, mass-transport model for field use. The model assumes a well-mixed conservative solute that may be coming from an unsteady source and is moving in unsteady streamflow. The quantity of solute being transported is in the units of concentration. Results are reported as such. An implicit finite-difference technique is used to solve the mass transport equation. It consists of creating a tridiagonal matrix and using the Thomas algorithm to solve the matrix for the unknown concentrations at the new time step. The computer program pesented is designed to compute the concentration of a water-quality constituent at any point and at any preselected time in a one-dimensional stream. The model is driven by the inflowing concentration of solute at the upstream boundary and is influenced by the solute entering the stream from tributaries and lateral ground-water inflow and from a source or sink. (Woodard-USGS)

Quantum Linear System Algorithm for Dense Matrices.

PubMed

Wossnig, Leonard; Zhao, Zhikuan; Prakash, Anupam

2018-02-02

Solving linear systems of equations is a frequently encountered problem in machine learning and optimization. Given a matrix A and a vector b the task is to find the vector x such that Ax=b. We describe a quantum algorithm that achieves a sparsity-independent runtime scaling of O(κ^{2}sqrt[n]polylog(n)/ε) for an n×n dimensional A with bounded spectral norm, where κ denotes the condition number of A, and ε is the desired precision parameter. This amounts to a polynomial improvement over known quantum linear system algorithms when applied to dense matrices, and poses a new state of the art for solving dense linear systems on a quantum computer. Furthermore, an exponential improvement is achievable if the rank of A is polylogarithmic in the matrix dimension. Our algorithm is built upon a singular value estimation subroutine, which makes use of a memory architecture that allows for efficient preparation of quantum states that correspond to the rows of A and the vector of Euclidean norms of the rows of A.

Full three-body problem in effective-field-theory models of gravity

NASA Astrophysics Data System (ADS)

Battista, Emmanuele; Esposito, Giampiero

2014-10-01

Recent work in the literature has studied the restricted three-body problem within the framework of effective-field-theory models of gravity. This paper extends such a program by considering the full three-body problem, when the Newtonian potential is replaced by a more general central potential which depends on the mutual separations of the three bodies. The general form of the equations of motion is written down, and they are studied when the interaction potential reduces to the quantum-corrected central potential considered recently in the literature. A recursive algorithm is found for solving the associated variational equations, which describe small departures from given periodic solutions of the equations of motion. Our scheme involves repeated application of a 2×2 matrix of first-order linear differential operators.

Nonlinear vibration of viscoelastic beams described using fractional order derivatives

NASA Astrophysics Data System (ADS)

Lewandowski, Roman; Wielentejczyk, Przemysław

2017-07-01

The problem of non-linear, steady state vibration of beams, harmonically excited by harmonic forces is investigated in the paper. The viscoelastic material of the beams is described using the Zener rheological model with fractional derivatives. The constitutive equation, which contains derivatives of both stress and strain, significantly complicates the solution to the problem. The von Karman theory is applied to take into account geometric nonlinearities. Amplitude equations are obtained using the finite element method together with the harmonic balance method, and solved using the continuation method. The tangent matrix of the amplitude equations is determined in an explicit form. The stability of the steady-state solution is also examined. A parametric study is carried out to determine the influence of viscoelastic properties of the material on the beam's responses.

Collective modes of a two-dimensional Fermi gas at finite temperature

NASA Astrophysics Data System (ADS)

Mulkerin, Brendan C.; Liu, Xia-Ji; Hu, Hui

2018-05-01

We examine the breathing mode of a strongly interacting two-dimensional Fermi gas and the role of temperature on the anomalous breaking of scale invariance. By calculating the equation of state with different many-body T -matrix theories and the virial expansion, we obtain a hydrodynamic equation of the harmonically trapped Fermi gas (with trapping frequency ω0) through the local density approximation. By solving the hydrodynamic equations, we determine the breathing mode frequencies as a function of interaction strength and temperature. We find that the breathing mode anomaly depends sensitively on both interaction strength and temperature. In particular, in the strongly interacting regime, we predict a significant downshift of the breathing mode frequency, below the scale invariant value of 2 ω0 , for temperatures of the order of the Fermi temperature.

Grid adaption for bluff bodies

NASA Technical Reports Server (NTRS)

Abolhassani, Jamshid S.; Tiwari, Surendra N.

1986-01-01

Methods of grid adaptation are reviewed and a method is developed with the capability of adaptation to several flow variables. This method is based on a variational approach and is an algebraic method which does not require the solution of partial differential equations. Also the method was formulated in such a way that there is no need for any matrix inversion. The method is used in conjunction with the calculation of hypersonic flow over a blunt nose. The equations of motion are the compressible Navier-Stokes equations where all viscous terms are retained. They are solved by the MacCormack time-splitting method and a movie was produced which shows simulataneously the transient behavior of the solution and the grid adaptation. The results are compared with the experimental and other numerical results.

A general parallel sparse-blocked matrix multiply for linear scaling SCF theory

NASA Astrophysics Data System (ADS)

Challacombe, Matt

2000-06-01

A general approach to the parallel sparse-blocked matrix-matrix multiply is developed in the context of linear scaling self-consistent-field (SCF) theory. The data-parallel message passing method uses non-blocking communication to overlap computation and communication. The space filling curve heuristic is used to achieve data locality for sparse matrix elements that decay with “separation”. Load balance is achieved by solving the bin packing problem for blocks with variable size.With this new method as the kernel, parallel performance of the simplified density matrix minimization (SDMM) for solution of the SCF equations is investigated for RHF/6-31G ∗∗ water clusters and RHF/3-21G estane globules. Sustained rates above 5.7 GFLOPS for the SDMM have been achieved for (H 2 O) 200 with 95 Origin 2000 processors. Scalability is found to be limited by load imbalance, which increases with decreasing granularity, due primarily to the inhomogeneous distribution of variable block sizes.

Arbitrarily high-order time-stepping schemes based on the operator spectrum theory for high-dimensional nonlinear Klein-Gordon equations

NASA Astrophysics Data System (ADS)

Liu, Changying; Wu, Xinyuan

2017-07-01

In this paper we explore arbitrarily high-order Lagrange collocation-type time-stepping schemes for effectively solving high-dimensional nonlinear Klein-Gordon equations with different boundary conditions. We begin with one-dimensional periodic boundary problems and first formulate an abstract ordinary differential equation (ODE) on a suitable infinity-dimensional function space based on the operator spectrum theory. We then introduce an operator-variation-of-constants formula which is essential for the derivation of our arbitrarily high-order Lagrange collocation-type time-stepping schemes for the nonlinear abstract ODE. The nonlinear stability and convergence are rigorously analysed once the spatial differential operator is approximated by an appropriate positive semi-definite matrix under some suitable smoothness assumptions. With regard to the two dimensional Dirichlet or Neumann boundary problems, our new time-stepping schemes coupled with discrete Fast Sine / Cosine Transformation can be applied to simulate the two-dimensional nonlinear Klein-Gordon equations effectively. All essential features of the methodology are present in one-dimensional and two-dimensional cases, although the schemes to be analysed lend themselves with equal to higher-dimensional case. The numerical simulation is implemented and the numerical results clearly demonstrate the advantage and effectiveness of our new schemes in comparison with the existing numerical methods for solving nonlinear Klein-Gordon equations in the literature.

Bending of Euler-Bernoulli nanobeams based on the strain-driven and stress-driven nonlocal integral models: a numerical approach

NASA Astrophysics Data System (ADS)

Oskouie, M. Faraji; Ansari, R.; Rouhi, H.

2018-04-01

Eringen's nonlocal elasticity theory is extensively employed for the analysis of nanostructures because it is able to capture nanoscale effects. Previous studies have revealed that using the differential form of the strain-driven version of this theory leads to paradoxical results in some cases, such as bending analysis of cantilevers, and recourse must be made to the integral version. In this article, a novel numerical approach is developed for the bending analysis of Euler-Bernoulli nanobeams in the context of strain- and stress-driven integral nonlocal models. This numerical approach is proposed for the direct solution to bypass the difficulties related to converting the integral governing equation into a differential equation. First, the governing equation is derived based on both strain-driven and stress-driven nonlocal models by means of the minimum total potential energy. Also, in each case, the governing equation is obtained in both strong and weak forms. To solve numerically the derived equations, matrix differential and integral operators are constructed based upon the finite difference technique and trapezoidal integration rule. It is shown that the proposed numerical approach can be efficiently applied to the strain-driven nonlocal model with the aim of resolving the mentioned paradoxes. Also, it is able to solve the problem based on the strain-driven model without inconsistencies of the application of this model that are reported in the literature.

Numerical Modeling of Nanoelectronic Devices

NASA Technical Reports Server (NTRS)

Klimeck, Gerhard; Oyafuso, Fabiano; Bowen, R. Chris; Boykin, Timothy

2003-01-01

Nanoelectronic Modeling 3-D (NEMO 3-D) is a computer program for numerical modeling of the electronic structure properties of a semiconductor device that is embodied in a crystal containing as many as 16 million atoms in an arbitrary configuration and that has overall dimensions of the order of tens of nanometers. The underlying mathematical model represents the quantummechanical behavior of the device resolved to the atomistic level of granularity. The system of electrons in the device is represented by a sparse Hamiltonian matrix that contains hundreds of millions of terms. NEMO 3-D solves the matrix equation on a Beowulf-class cluster computer, by use of a parallel-processing matrix vector multiplication algorithm coupled to a Lanczos and/or Rayleigh-Ritz algorithm that solves for eigenvalues. In a recent update of NEMO 3-D, a new strain treatment, parameterized for bulk material properties of GaAs and InAs, was developed for two tight-binding submodels. The utility of the NEMO 3-D was demonstrated in an atomistic analysis of the effects of disorder in alloys and, in particular, in bulk In(x)Ga(l-x)As and in In0.6Ga0.4As quantum dots.

Large-scale computation of incompressible viscous flow by least-squares finite element method

NASA Technical Reports Server (NTRS)

Jiang, Bo-Nan; Lin, T. L.; Povinelli, Louis A.

1993-01-01

The least-squares finite element method (LSFEM) based on the velocity-pressure-vorticity formulation is applied to large-scale/three-dimensional steady incompressible Navier-Stokes problems. This method can accommodate equal-order interpolations and results in symmetric, positive definite algebraic system which can be solved effectively by simple iterative methods. The first-order velocity-Bernoulli function-vorticity formulation for incompressible viscous flows is also tested. For three-dimensional cases, an additional compatibility equation, i.e., the divergence of the vorticity vector should be zero, is included to make the first-order system elliptic. The simple substitution of the Newton's method is employed to linearize the partial differential equations, the LSFEM is used to obtain discretized equations, and the system of algebraic equations is solved using the Jacobi preconditioned conjugate gradient method which avoids formation of either element or global matrices (matrix-free) to achieve high efficiency. To show the validity of this scheme for large-scale computation, we give numerical results for 2D driven cavity problem at Re = 10000 with 408 x 400 bilinear elements. The flow in a 3D cavity is calculated at Re = 100, 400, and 1,000 with 50 x 50 x 50 trilinear elements. The Taylor-Goertler-like vortices are observed for Re = 1,000.

Parallel computation using boundary elements in solid mechanics

NASA Technical Reports Server (NTRS)

Chien, L. S.; Sun, C. T.

1990-01-01

The inherent parallelism of the boundary element method is shown. The boundary element is formulated by assuming the linear variation of displacements and tractions within a line element. Moreover, MACSYMA symbolic program is employed to obtain the analytical results for influence coefficients. Three computational components are parallelized in this method to show the speedup and efficiency in computation. The global coefficient matrix is first formed concurrently. Then, the parallel Gaussian elimination solution scheme is applied to solve the resulting system of equations. Finally, and more importantly, the domain solutions of a given boundary value problem are calculated simultaneously. The linear speedups and high efficiencies are shown for solving a demonstrated problem on Sequent Symmetry S81 parallel computing system.

Solving Differential Equations in R: Package deSolve

EPA Science Inventory

In this paper we present the R package deSolve to solve initial value problems (IVP) written as ordinary differential equations (ODE), differential algebraic equations (DAE) of index 0 or 1 and partial differential equations (PDE), the latter solved using the method of lines appr...

High-performance equation solvers and their impact on finite element analysis

NASA Technical Reports Server (NTRS)

Poole, Eugene L.; Knight, Norman F., Jr.; Davis, D. Dale, Jr.

1990-01-01

The role of equation solvers in modern structural analysis software is described. Direct and iterative equation solvers which exploit vectorization on modern high-performance computer systems are described and compared. The direct solvers are two Cholesky factorization methods. The first method utilizes a novel variable-band data storage format to achieve very high computation rates and the second method uses a sparse data storage format designed to reduce the number of operations. The iterative solvers are preconditioned conjugate gradient methods. Two different preconditioners are included; the first uses a diagonal matrix storage scheme to achieve high computation rates and the second requires a sparse data storage scheme and converges to the solution in fewer iterations that the first. The impact of using all of the equation solvers in a common structural analysis software system is demonstrated by solving several representative structural analysis problems.

High-performance equation solvers and their impact on finite element analysis

NASA Technical Reports Server (NTRS)

Poole, Eugene L.; Knight, Norman F., Jr.; Davis, D. D., Jr.

1992-01-01

The role of equation solvers in modern structural analysis software is described. Direct and iterative equation solvers which exploit vectorization on modern high-performance computer systems are described and compared. The direct solvers are two Cholesky factorization methods. The first method utilizes a novel variable-band data storage format to achieve very high computation rates and the second method uses a sparse data storage format designed to reduce the number od operations. The iterative solvers are preconditioned conjugate gradient methods. Two different preconditioners are included; the first uses a diagonal matrix storage scheme to achieve high computation rates and the second requires a sparse data storage scheme and converges to the solution in fewer iterations that the first. The impact of using all of the equation solvers in a common structural analysis software system is demonstrated by solving several representative structural analysis problems.

Two-boundary grid generation for the solution of the three dimensional compressible Navier-Stokes equations. Ph.D. Thesis - Old Dominion Univ.

NASA Technical Reports Server (NTRS)

Smith, R. E.

1981-01-01

A grid generation technique called the two boundary technique is developed and applied for the solution of the three dimensional Navier-Stokes equations. The Navier-Stokes equations are transformed from a cartesian coordinate system to a computational coordinate system, and the grid generation technique provides the Jacobian matrix describing the transformation. The two boundary technique is based on algebraically defining two distinct boundaries of a flow domain and the distribution of the grid is achieved by applying functions to the uniform computational grid which redistribute the computational independent variables and consequently concentrate or disperse the grid points in the physical domain. The Navier-Stokes equations are solved using a MacCormack time-split technique. Grids and supersonic laminar flow solutions are obtained for a family of three dimensional corners and two spike-nosed bodies.

Efficient 3D inversions using the Richards equation

NASA Astrophysics Data System (ADS)

Cockett, Rowan; Heagy, Lindsey J.; Haber, Eldad

2018-07-01

Fluid flow in the vadose zone is governed by the Richards equation; it is parameterized by hydraulic conductivity, which is a nonlinear function of pressure head. Investigations in the vadose zone typically require characterizing distributed hydraulic properties. Water content or pressure head data may include direct measurements made from boreholes. Increasingly, proxy measurements from hydrogeophysics are being used to supply more spatially and temporally dense data sets. Inferring hydraulic parameters from such datasets requires the ability to efficiently solve and optimize the nonlinear time domain Richards equation. This is particularly important as the number of parameters to be estimated in a vadose zone inversion continues to grow. In this paper, we describe an efficient technique to invert for distributed hydraulic properties in 1D, 2D, and 3D. Our technique does not store the Jacobian matrix, but rather computes its product with a vector. Existing literature for the Richards equation inversion explicitly calculates the sensitivity matrix using finite difference or automatic differentiation, however, for large scale problems these methods are constrained by computation and/or memory. Using an implicit sensitivity algorithm enables large scale inversion problems for any distributed hydraulic parameters in the Richards equation to become tractable on modest computational resources. We provide an open source implementation of our technique based on the SimPEG framework, and show it in practice for a 3D inversion of saturated hydraulic conductivity using water content data through time.

Time dependent Schrödinger equation for black hole evaporation: No information loss

NASA Astrophysics Data System (ADS)

Corda, Christian

2015-02-01

In 1976 S. Hawking claimed that "Because part of the information about the state of the system is lost down the hole, the final situation is represented by a density matrix rather than a pure quantum state".1 In a series of papers, together with collaborators, we naturally interpreted BH quasi-normal modes (QNMs) in terms of quantum levels discussing a model of excited BH somewhat similar to the historical semi-classical Bohr model of the structure of a hydrogen atom. Here we explicitly write down, for the same model, a time dependent Schrödinger equation for the system composed by Hawking radiation and BH QNMs. The physical state and the correspondent wave function are written in terms of a unitary evolution matrix instead of a density matrix. Thus, the final state results to be a pure quantum state instead of a mixed one. Hence, Hawking's claim is falsified because BHs result to be well defined quantum mechanical systems, having ordered, discrete quantum spectra, which respect 't Hooft's assumption that Schrödinger equations can be used universally for all dynamics in the universe. As a consequence, information comes out in BH evaporation in terms of pure states in a unitary time dependent evolution. In Section 4 of this paper we show that the present approach permits also to solve the entanglement problem connected with the information paradox.

Recovery Discontinuous Galerkin Jacobian-Free Newton-Krylov Method for All-Speed Flows

DOE Office of Scientific and Technical Information (OSTI.GOV)

HyeongKae Park; Robert Nourgaliev; Vincent Mousseau

2008-07-01

A novel numerical algorithm (rDG-JFNK) for all-speed fluid flows with heat conduction and viscosity is introduced. The rDG-JFNK combines the Discontinuous Galerkin spatial discretization with the implicit Runge-Kutta time integration under the Jacobian-free Newton-Krylov framework. We solve fully-compressible Navier-Stokes equations without operator-splitting of hyperbolic, diffusion and reaction terms, which enables fully-coupled high-order temporal discretization. The stability constraint is removed due to the L-stable Explicit, Singly Diagonal Implicit Runge-Kutta (ESDIRK) scheme. The governing equations are solved in the conservative form, which allows one to accurately compute shock dynamics, as well as low-speed flows. For spatial discretization, we develop a “recovery” familymore » of DG, exhibiting nearly-spectral accuracy. To precondition the Krylov-based linear solver (GMRES), we developed an “Operator-Split”-(OS) Physics Based Preconditioner (PBP), in which we transform/simplify the fully-coupled system to a sequence of segregated scalar problems, each can be solved efficiently with Multigrid method. Each scalar problem is designed to target/cluster eigenvalues of the Jacobian matrix associated with a specific physics.« less

Straightening: existence, uniqueness and stability

PubMed Central

Destrade, M.; Ogden, R. W.; Sgura, I.; Vergori, L.

2014-01-01

One of the least studied universal deformations of incompressible nonlinear elasticity, namely the straightening of a sector of a circular cylinder into a rectangular block, is revisited here and, in particular, issues of existence and stability are addressed. Particular attention is paid to the system of forces required to sustain the large static deformation, including by the application of end couples. The influence of geometric parameters and constitutive models on the appearance of wrinkles on the compressed face of the block is also studied. Different numerical methods for solving the incremental stability problem are compared and it is found that the impedance matrix method, based on the resolution of a matrix Riccati differential equation, is the more precise. PMID:24711723

Extending fields in a level set method by solving a biharmonic equation

NASA Astrophysics Data System (ADS)

Moroney, Timothy J.; Lusmore, Dylan R.; McCue, Scott W.; McElwain, D. L. Sean

2017-08-01

We present an approach for computing extensions of velocities or other fields in level set methods by solving a biharmonic equation. The approach differs from other commonly used approaches to velocity extension because it deals with the interface fully implicitly through the level set function. No explicit properties of the interface, such as its location or the velocity on the interface, are required in computing the extension. These features lead to a particularly simple implementation using either a sparse direct solver or a matrix-free conjugate gradient solver. Furthermore, we propose a fast Poisson preconditioner that can be used to accelerate the convergence of the latter. We demonstrate the biharmonic extension on a number of test problems that serve to illustrate its effectiveness at producing smooth and accurate extensions near interfaces. A further feature of the method is the natural way in which it deals with symmetry and periodicity, ensuring through its construction that the extension field also respects these symmetries.

Semiclassical theory of sub-Doppler forces in an asymmetric magneto-optical trap with unequal laser detunings

DOE Office of Scientific and Technical Information (OSTI.GOV)

Noh, Heung-Ryoul; Jhe, Wonho

We present a semiclassical theory of the sub-Doppler forces in an asymmetric magneto-optical trap where the trap-laser frequencies are unequal to one another. To solve the optical Bloch equations, which contain explicit time dependence, unlike in the symmetric case of equal laser detunings, we have developed a convenient and efficient method to calculate the atomic forces at various oscillating frequencies for each atomic density matrix element. In particular, the theory provides a qualitative understanding of the array of sub-Doppler traps (SDTs) recently observed in such an asymmetric trap. We find that the distances between SDTs are proportional to the relativemore » detuning differences, in good agreement with experimental results. The theory presented here can be applied to a dynamic system with multiple laser frequencies involved; the number of coupled equations to solve is much reduced and the resulting numerical calculation can be performed rather simply and efficiently.« less

Extending the capability of GYRE to calculate tidally forced stellar oscillations

NASA Astrophysics Data System (ADS)

Guo, Zhao; Gies, Douglas R.

2016-01-01

Tidally forced oscillations have been observed in many eccentric binary systems, such as KOI-54 and many other 'heart beat stars'. The tidal response of the star can be calculated by solving a revised stellar oscillations equations.The open-source stellar oscillation code GYRE (Townsend & Teitler 2013) can be used to solve the free stellar oscillation equations in both adiabatic and non-adiabatic cases. It uses a novel matrix exponential method which avoids many difficulties of the classical shooting and relaxation method. The new version also includes the effect of rotation in traditional approximation.After showing the code flow of GYRE, we revise its subroutines and extend its capability to calculate tidallyforced oscillations in both adiabatic and non-adiabatic cases following the procedure in the CAFein code (Valsecchi et al. 2013). In the end, we compare the tidal eigenfunctions with those calculated from CAFein.More details of the revision and a simple version of the code in MATLAB can be obtained upon request.

Simultaneous heat and mass transfer inside a vertical channel in evaporating a heated falling glycols liquid film

NASA Astrophysics Data System (ADS)

Nait Alla, Abderrahman; Feddaoui, M'barek; Meftah, Hicham

2015-12-01

The interactive effects of heat and mass transfer in the evaporation of ethylene and propylene glycol flowing as falling films on vertical channel was investigated. The liquid film falls along a left plate which is externally subjected to a uniform heat flux while the right plate is the dry wall and is kept thermally insulated. The model solves the coupled governing equations in both phases together with the boundary and interfacial conditions. The systems of equations obtained by using an implicit finite difference method are solved by Tridiagonal Matrix Algorithm. The influence of the inlet liquid flow, Reynolds number in the gas flow and the wall heat flux on the intensity of heat and mass transfers are examined. A comparison between the results obtained for studied glycols and water in the same conditions is made. The results indicate that water evaporates in more intense way in comparison to glycols and the increase of gas flow rate tends to improve slightly the evaporation.

Solving lattice QCD systems of equations using mixed precision solvers on GPUs

NASA Astrophysics Data System (ADS)

Clark, M. A.; Babich, R.; Barros, K.; Brower, R. C.; Rebbi, C.

2010-09-01

Modern graphics hardware is designed for highly parallel numerical tasks and promises significant cost and performance benefits for many scientific applications. One such application is lattice quantum chromodynamics (lattice QCD), where the main computational challenge is to efficiently solve the discretized Dirac equation in the presence of an SU(3) gauge field. Using NVIDIA's CUDA platform we have implemented a Wilson-Dirac sparse matrix-vector product that performs at up to 40, 135 and 212 Gflops for double, single and half precision respectively on NVIDIA's GeForce GTX 280 GPU. We have developed a new mixed precision approach for Krylov solvers using reliable updates which allows for full double precision accuracy while using only single or half precision arithmetic for the bulk of the computation. The resulting BiCGstab and CG solvers run in excess of 100 Gflops and, in terms of iterations until convergence, perform better than the usual defect-correction approach for mixed precision.

Wave multiple scattering by a finite number of unclosed circular cylinders

NASA Technical Reports Server (NTRS)

Veliyev, E. I.; Veremey, V. V.

1984-01-01

The boundary value problem of plane H-polarized electromagnetic wave multiple scattering by a finite number of unclosed circular cylinders is solved. The solution is obtained by two different methods: the method of successive scattering and the method of partial matrix inversion for simultaneous dual equations. The advantages of the successive scattering method are shown. Computer calculations of the suface currents and the total cross section are presented for the structure of two screens.

Dependent scattering and absorption by densely packed discrete spherical particles: Effects of complex refractive index

NASA Astrophysics Data System (ADS)

Ma, L. X.; Tan, J. Y.; Zhao, J. M.; Wang, F. Q.; Wang, C. A.; Wang, Y. Y.

2017-07-01

Due to the dependent scattering and absorption effects, the radiative transfer equation (RTE) may not be suitable for dealing with radiative transfer in dense discrete random media. This paper continues previous research on multiple and dependent scattering in densely packed discrete particle systems, and puts emphasis on the effects of particle complex refractive index. The Mueller matrix elements of the scattering system with different complex refractive indexes are obtained by both electromagnetic method and radiative transfer method. The Maxwell equations are directly solved based on the superposition T-matrix method, while the RTE is solved by the Monte Carlo method combined with the hard sphere model in the Percus-Yevick approximation (HSPYA) to consider the dependent scattering effects. The results show that for densely packed discrete random media composed of medium size parameter particles (equals 6.964 in this study), the demarcation line between independent and dependent scattering has remarkable connections with the particle complex refractive index. With the particle volume fraction increase to a certain value, densely packed discrete particles with higher refractive index contrasts between the particles and host medium and higher particle absorption indexes are more likely to show stronger dependent characteristics. Due to the failure of the extended Rayleigh-Debye scattering condition, the HSPYA has weak effect on the dependent scattering correction at large phase shift parameters.

Numerical implementation, verification and validation of two-phase flow four-equation drift flux model with Jacobian-free Newton–Krylov method

DOE PAGES

Zou, Ling; Zhao, Haihua; Zhang, Hongbin

2016-08-24

This study presents a numerical investigation on using the Jacobian-free Newton–Krylov (JFNK) method to solve the two-phase flow four-equation drift flux model with realistic constitutive correlations (‘closure models’). The drift flux model is based on Isshi and his collaborators’ work. Additional constitutive correlations for vertical channel flow, such as two-phase flow pressure drop, flow regime map, wall boiling and interfacial heat transfer models, were taken from the RELAP5-3D Code Manual and included to complete the model. The staggered grid finite volume method and fully implicit backward Euler method was used for the spatial discretization and time integration schemes, respectively. Themore » Jacobian-free Newton–Krylov method shows no difficulty in solving the two-phase flow drift flux model with a discrete flow regime map. In addition to the Jacobian-free approach, the preconditioning matrix is obtained by using the default finite differencing method provided in the PETSc package, and consequently the labor-intensive implementation of complex analytical Jacobian matrix is avoided. Extensive and successful numerical verification and validation have been performed to prove the correct implementation of the models and methods. Code-to-code comparison with RELAP5-3D has further demonstrated the successful implementation of the drift flux model.« less

Thermal form-factor approach to dynamical correlation functions of integrable lattice models

NASA Astrophysics Data System (ADS)

Göhmann, Frank; Karbach, Michael; Klümper, Andreas; Kozlowski, Karol K.; Suzuki, Junji

2017-11-01

We propose a method for calculating dynamical correlation functions at finite temperature in integrable lattice models of Yang-Baxter type. The method is based on an expansion of the correlation functions as a series over matrix elements of a time-dependent quantum transfer matrix rather than the Hamiltonian. In the infinite Trotter-number limit the matrix elements become time independent and turn into the thermal form factors studied previously in the context of static correlation functions. We make this explicit with the example of the XXZ model. We show how the form factors can be summed utilizing certain auxiliary functions solving finite sets of nonlinear integral equations. The case of the XX model is worked out in more detail leading to a novel form-factor series representation of the dynamical transverse two-point function.

Ward identities and combinatorics of rainbow tensor models

NASA Astrophysics Data System (ADS)

Itoyama, H.; Mironov, A.; Morozov, A.

2017-06-01

We discuss the notion of renormalization group (RG) completion of non-Gaussian Lagrangians and its treatment within the framework of Bogoliubov-Zimmermann theory in application to the matrix and tensor models. With the example of the simplest non-trivial RGB tensor theory (Aristotelian rainbow), we introduce a few methods, which allow one to connect calculations in the tensor models to those in the matrix models. As a byproduct, we obtain some new factorization formulas and sum rules for the Gaussian correlators in the Hermitian and complex matrix theories, square and rectangular. These sum rules describe correlators as solutions to finite linear systems, which are much simpler than the bilinear Hirota equations and the infinite Virasoro recursion. Search for such relations can be a way to solving the tensor models, where an explicit integrability is still obscure.

[Series: Utilization of Differential Equations and Methods for Solving Them in Medical Physics (2)].

PubMed

Murase, Kenya

2015-01-01

In this issue, symbolic methods for solving differential equations were firstly introduced. Of the symbolic methods, Laplace transform method was also introduced together with some examples, in which this method was applied to solving the differential equations derived from a two-compartment kinetic model and an equivalent circuit model for membrane potential. Second, series expansion methods for solving differential equations were introduced together with some examples, in which these methods were used to solve Bessel's and Legendre's differential equations. In the next issue, simultaneous differential equations and various methods for solving these differential equations will be introduced together with some examples in medical physics.

Quantum algorithm for linear systems of equations.

PubMed

Harrow, Aram W; Hassidim, Avinatan; Lloyd, Seth

2009-10-09

Solving linear systems of equations is a common problem that arises both on its own and as a subroutine in more complex problems: given a matrix A and a vector b(-->), find a vector x(-->) such that Ax(-->) = b(-->). We consider the case where one does not need to know the solution x(-->) itself, but rather an approximation of the expectation value of some operator associated with x(-->), e.g., x(-->)(dagger) Mx(-->) for some matrix M. In this case, when A is sparse, N x N and has condition number kappa, the fastest known classical algorithms can find x(-->) and estimate x(-->)(dagger) Mx(-->) in time scaling roughly as N square root(kappa). Here, we exhibit a quantum algorithm for estimating x(-->)(dagger) Mx(-->) whose runtime is a polynomial of log(N) and kappa. Indeed, for small values of kappa [i.e., poly log(N)], we prove (using some common complexity-theoretic assumptions) that any classical algorithm for this problem generically requires exponentially more time than our quantum algorithm.

Fast matrix treatment of 3-D radiative transfer in vegetation canopies: SPARTACUS-Vegetation 1.1

NASA Astrophysics Data System (ADS)

Hogan, Robin J.; Quaife, Tristan; Braghiere, Renato

2018-01-01

A fast scheme is described to compute the 3-D interaction of solar radiation with vegetation canopies. The canopy is split in the horizontal plane into one clear region and one or more vegetated regions, and the two-stream equations are used for each, but with additional terms representing lateral exchange of radiation between regions that are proportional to the area of the interface between them. The resulting coupled set of ordinary differential equations is solved using the matrix-exponential method. The scheme is compared to solar Monte Carlo calculations for idealized scenes from the RAMI4PILPS intercomparison project, for open forest canopies and shrublands both with and without snow on the ground. Agreement is good in both the visible and infrared: for the cases compared, the root-mean-squared difference in reflectance, transmittance and canopy absorptance is 0.020, 0.038 and 0.033, respectively. The technique has potential application to weather and climate modelling.

Activation product transport in fusion reactors. [RAPTOR

DOE Office of Scientific and Technical Information (OSTI.GOV)

Klein, A.C.

1983-01-01

Activated corrosion and neutron sputtering products will enter the coolant and/or tritium breeding material of fusion reactor power plants and experiments and cause personnel access problems. Radiation levels around plant components due to these products will cause difficulties with maintenance and repair operations throughout the plant. Similar problems are experienced around fission reactor systems. The determination of the transport of radioactive corrosion and neutron sputtering products through the system is achieved using the computer code RAPTOR. This code calculates the mass transfer of a number of activation products based on the corrosion and sputtering rates through the system, the depositionmore » and release characteristics of various plant components, the neturon flux spectrum, as well as other plant parameters. RAPTOR assembles a system of first order linear differential equations into a matrix equation based upon the reactor system parameters. Included in the transfer matrix are the deposition and erosion coefficients, and the decay and activation data for the various plant nodes and radioactive isotopes. A source vector supplies the corrosion and neutron sputtering source rates. This matrix equation is then solved using a matrix operator technique to give the specific activity distribution of each radioactive species throughout the plant. Once the amount of mass transfer is determined, the photon transport due to the radioactive corrosion and sputtering product sources can be evaluated, and dose rates around the plant components of interest as a function of time can be determined. This method has been used to estimate the radiation hazards around a number of fusion reactor system designs.« less

Linear-scaling implementation of molecular response theory in self-consistent field electronic-structure theory.

PubMed

Coriani, Sonia; Høst, Stinne; Jansík, Branislav; Thøgersen, Lea; Olsen, Jeppe; Jørgensen, Poul; Reine, Simen; Pawłowski, Filip; Helgaker, Trygve; Sałek, Paweł

2007-04-21

A linear-scaling implementation of Hartree-Fock and Kohn-Sham self-consistent field theories for the calculation of frequency-dependent molecular response properties and excitation energies is presented, based on a nonredundant exponential parametrization of the one-electron density matrix in the atomic-orbital basis, avoiding the use of canonical orbitals. The response equations are solved iteratively, by an atomic-orbital subspace method equivalent to that of molecular-orbital theory. Important features of the subspace method are the use of paired trial vectors (to preserve the algebraic structure of the response equations), a nondiagonal preconditioner (for rapid convergence), and the generation of good initial guesses (for robust solution). As a result, the performance of the iterative method is the same as in canonical molecular-orbital theory, with five to ten iterations needed for convergence. As in traditional direct Hartree-Fock and Kohn-Sham theories, the calculations are dominated by the construction of the effective Fock/Kohn-Sham matrix, once in each iteration. Linear complexity is achieved by using sparse-matrix algebra, as illustrated in calculations of excitation energies and frequency-dependent polarizabilities of polyalanine peptides containing up to 1400 atoms.

Auto-Bäcklund transformations for a matrix partial differential equation

NASA Astrophysics Data System (ADS)

Gordoa, P. R.; Pickering, A.

2018-07-01

We derive auto-Bäcklund transformations, analogous to those of the matrix second Painlevé equation, for a matrix partial differential equation. We also then use these auto-Bäcklund transformations to derive matrix equations involving shifts in a discrete variable, a process analogous to the use of the auto-Bäcklund transformations of the matrix second Painlevé equation to derive a discrete matrix first Painlevé equation. The equations thus derived then include amongst other examples a semidiscrete matrix equation which can be considered to be an extension of this discrete matrix first Painlevé equation. The application of this technique to the auto-Bäcklund transformations of the scalar case of our partial differential equation has not been considered before, and so the results obtained here in this scalar case are also new. Other equations obtained here using this technique include a scalar semidiscrete equation which arises in the case of the second Painlevé equation, and which does not seem to have been thus derived previously.

Numerical Manifold Method for the Forced Vibration of Thin Plates during Bending

PubMed Central

Jun, Ding; Song, Chen; Wei-Bin, Wen; Shao-Ming, Luo; Xia, Huang

2014-01-01

A novel numerical manifold method was derived from the cubic B-spline basis function. The new interpolation function is characterized by high-order coordination at the boundary of a manifold element. The linear elastic-dynamic equation used to solve the bending vibration of thin plates was derived according to the principle of minimum instantaneous potential energy. The method for the initialization of the dynamic equation and its solution process were provided. Moreover, the analysis showed that the calculated stiffness matrix exhibited favorable performance. Numerical results showed that the generalized degrees of freedom were significantly fewer and that the calculation accuracy was higher for the manifold method than for the conventional finite element method. PMID:24883403

Scattering and Emission from Inhomogeneous Vegetation Canopy and Alien Target by Using Three-Dimensional Vector Radiative Transfer (3D-VRT) Equation

NASA Astrophysics Data System (ADS)

Jin, Ya-Qiu; Liang, Zichang

2005-01-01

To solve 3D-VRT equation for the model of spatially inhomogeneous scatter media, the finite enclosure of the scatter media is geometrically divided, in both the vertical z and horizontal (x,y) directions, to form very thin multi-boxes. The zero-th order emission, first-order Mueller matrix of each thin box and an iterative approach of high-order radiative transfer are applied to deriving high-order scattering and emission of whole inhomogeneous scatter media. Numerical results of polarized brightness temperature at microwave frequency and under different radiometer's resolutions from inhomogeneous scatter model such as vegetation canopy and embedded alien target are simulated and discussed.

Geometrically Flexible and Efficient Flow Analysis of High Speed Vehicles Via Domain Decomposition, Part 1: Unstructured-Grid Solver for High Speed Flows

NASA Technical Reports Server (NTRS)

White, Jeffery A.; Baurle, Robert A.; Passe, Bradley J.; Spiegel, Seth C.; Nishikawa, Hiroaki

2017-01-01

The ability to solve the equations governing the hypersonic turbulent flow of a real gas on unstructured grids using a spatially-elliptic, 2nd-order accurate, cell-centered, finite-volume method has been recently implemented in the VULCAN-CFD code. This paper describes the key numerical methods and techniques that were found to be required to robustly obtain accurate solutions to hypersonic flows on non-hex-dominant unstructured grids. The methods and techniques described include: an augmented stencil, weighted linear least squares, cell-average gradient method, a robust multidimensional cell-average gradient-limiter process that is consistent with the augmented stencil of the cell-average gradient method and a cell-face gradient method that contains a cell skewness sensitive damping term derived using hyperbolic diffusion based concepts. A data-parallel matrix-based symmetric Gauss-Seidel point-implicit scheme, used to solve the governing equations, is described and shown to be more robust and efficient than a matrix-free alternative. In addition, a y+ adaptive turbulent wall boundary condition methodology is presented. This boundary condition methodology is deigned to automatically switch between a solve-to-the-wall and a wall-matching-function boundary condition based on the local y+ of the 1st cell center off the wall. The aforementioned methods and techniques are then applied to a series of hypersonic and supersonic turbulent flat plate unit tests to examine the efficiency, robustness and convergence behavior of the implicit scheme and to determine the ability of the solve-to-the-wall and y+ adaptive turbulent wall boundary conditions to reproduce the turbulent law-of-the-wall. Finally, the thermally perfect, chemically frozen, Mach 7.8 turbulent flow of air through a scramjet flow-path is computed and compared with experimental data to demonstrate the robustness, accuracy and convergence behavior of the unstructured-grid solver for a realistic 3-D geometry on a non-hex-dominant grid.

A Riccati solution for the ideal MHD plasma response with applications to real-time stability control

NASA Astrophysics Data System (ADS)

Glasser, Alexander; Kolemen, Egemen; Glasser, A. H.

2018-03-01

Active feedback control of ideal MHD stability in a tokamak requires rapid plasma stability analysis. Toward this end, we reformulate the δW stability method with a Hamilton-Jacobi theory, elucidating analytical and numerical features of the generic tokamak ideal MHD stability problem. The plasma response matrix is demonstrated to be the solution of an ideal MHD matrix Riccati differential equation. Since Riccati equations are prevalent in the control theory literature, such a shift in perspective brings to bear a range of numerical methods that are well-suited to the robust, fast solution of control problems. We discuss the usefulness of Riccati techniques in solving the stiff ordinary differential equations often encountered in ideal MHD stability analyses—for example, in tokamak edge and stellarator physics. We demonstrate the applicability of such methods to an existing 2D ideal MHD stability code—DCON [A. H. Glasser, Phys. Plasmas 23, 072505 (2016)]—enabling its parallel operation in near real-time, with wall-clock time ≪1 s . Such speed may help enable active feedback ideal MHD stability control, especially in tokamak plasmas whose ideal MHD equilibria evolve with inductive timescale τ≳ 1s—as in ITER.

AN ADA LINEAR ALGEBRA PACKAGE MODELED AFTER HAL/S

NASA Technical Reports Server (NTRS)

Klumpp, A. R.

1994-01-01

This package extends the Ada programming language to include linear algebra capabilities similar to those of the HAL/S programming language. The package is designed for avionics applications such as Space Station flight software. In addition to the HAL/S built-in functions, the package incorporates the quaternion functions used in the Shuttle and Galileo projects, and routines from LINPAK that solve systems of equations involving general square matrices. Language conventions in this package follow those of HAL/S to the maximum extent practical and minimize the effort required for writing new avionics software and translating existent software into Ada. Valid numeric types in this package include scalar, vector, matrix, and quaternion declarations. (Quaternions are fourcomponent vectors used in representing motion between two coordinate frames). Single precision and double precision floating point arithmetic is available in addition to the standard double precision integer manipulation. Infix operators are used instead of function calls to define dot products, cross products, quaternion products, and mixed scalar-vector, scalar-matrix, and vector-matrix products. The package contains two generic programs: one for floating point, and one for integer. The actual component type is passed as a formal parameter to the generic linear algebra package. The procedures for solving systems of linear equations defined by general matrices include GEFA, GECO, GESL, and GIDI. The HAL/S functions include ABVAL, UNIT, TRACE, DET, INVERSE, TRANSPOSE, GET, PUT, FETCH, PLACE, and IDENTITY. This package is written in Ada (Version 1.2) for batch execution and is machine independent. The linear algebra software depends on nothing outside the Ada language except for a call to a square root function for floating point scalars (such as SQRT in the DEC VAX MATHLIB library). This program was developed in 1989, and is a copyrighted work with all copyright vested in NASA.

Encouraging Students to Think Strategically when Learning to Solve Linear Equations

ERIC Educational Resources Information Center

Robson, Daphne; Abell, Walt; Boustead, Therese

2012-01-01

Students who are preparing to study science and engineering need to understand equation solving but adult students returning to study can find this difficult. In this paper, the design of an online resource, Equations2go, for helping students learn to solve linear equations is investigated. Students learning to solve equations need to consider…

An improved algorithm for the determination of the system paramters of a visual binary by least squares

NASA Astrophysics Data System (ADS)

Xu, Yu-Lin

The problem of computing the orbit of a visual binary from a set of observed positions is reconsidered. It is a least squares adjustment problem, if the observational errors follow a bias-free multivariate Gaussian distribution and the covariance matrix of the observations is assumed to be known. The condition equations are constructed to satisfy both the conic section equation and the area theorem, which are nonlinear in both the observations and the adjustment parameters. The traditional least squares algorithm, which employs condition equations that are solved with respect to the uncorrelated observations and either linear in the adjustment parameters or linearized by developing them in Taylor series by first-order approximation, is inadequate in our orbit problem. D.C. Brown proposed an algorithm solving a more general least squares adjustment problem in which the scalar residual function, however, is still constructed by first-order approximation. Not long ago, a completely general solution was published by W.H Jefferys, who proposed a rigorous adjustment algorithm for models in which the observations appear nonlinearly in the condition equations and may be correlated, and in which construction of the normal equations and the residual function involves no approximation. This method was successfully applied in our problem. The normal equations were first solved by Newton's scheme. Practical examples show that this converges fast if the observational errors are sufficiently small and the initial approximate solution is sufficiently accurate, and that it fails otherwise. Newton's method was modified to yield a definitive solution in the case the normal approach fails, by combination with the method of steepest descent and other sophisticated algorithms. Practical examples show that the modified Newton scheme can always lead to a final solution. The weighting of observations, the orthogonal parameters and the efficiency of a set of adjustment parameters are also considered. The definition of efficiency is revised.

Recommendations for numerical solution of reinforced-panel and fuselage-ring problems

NASA Technical Reports Server (NTRS)

Hoff, N J; Libby, Paul A

1949-01-01

Procedures are recommended for solving the equations of equilibrium of reinforced panels and isolated fuselage rings as represented by the external loads and the operations table established according to Southwell's method. From the solution of these equations the stress distribution can be easily determined. The method of systematic relaxations, the matrix-calculus method, and several other methods applicable in special cases are discussed. Definite recommendations are made for obtaining the solution of reinforced-panel problems which are generally designated as shear lag problems. The procedures recommended are demonstrated in the analysis of a number of panels. In the case of fuselage rings it is not possible to make definite recommendations for the solution of the equilibrium equations for all rings and loadings. However, suggestions based on the latest experience are made and demonstrated on several rings.

Eigenvalue approach to coupled thermoelasticity in a rotating isotropic medium

NASA Astrophysics Data System (ADS)

Bayones, F. S.; Abd-Alla, A. M.

2018-03-01

In this paper the linear theory of the thermoelasticity has been employed to study the effect of the rotation in a thermoelastic half-space containing heat source on the boundary of the half-space. It is assumed that the medium under consideration is traction free, homogeneous, isotropic, as well as without energy dissipation. The normal mode analysis has been applied in the basic equations of coupled thermoelasticity and finally the resulting equations are written in the form of a vector- matrix differential equation which is then solved by eigenvalue approach. Numerical results for the displacement components, stresses, and temperature are given and illustrated graphically. Comparison was made with the results obtained in the presence and absence of the rotation. The results indicate that the effect of rotation, non-dimensional thermal wave and time are very pronounced.

Field Dislocation Mechanics for heterogeneous elastic materials: A numerical spectral approach

DOE Office of Scientific and Technical Information (OSTI.GOV)

Djaka, Komlan Senam; Villani, Aurelien; Taupin, Vincent

Spectral methods using Fast Fourier Transform (FFT) algorithms have recently seen a surge in interest in the mechanics of materials community. The present work addresses the critical question of determining accurate local mechanical fields using FFT methods without artificial fluctuations arising from materials and defects induced discontinuities. Precisely, this work introduces a numerical approach based on intrinsic discrete Fourier transforms for the simultaneous treatment of material discontinuities arising from the presence of dislocations and from elastic stiffness heterogeneities. To this end, the elasto-static equations of the field dislocation mechanics theory for periodic heterogeneous materials are numerically solved with FFT inmore » the case of dislocations in proximity of inclusions of varying stiffness. An optimal intrinsic discrete Fourier transform method is sought based on two distinct schemes. A centered finite difference scheme for differential rules are used for numerically solving the Poisson-type equation in the Fourier space, while centered finite differences on a rotated grid is chosen for the computation of the modified Fourier–Green’s operator associated with the Lippmann–Schwinger-type equation. By comparing different methods with analytical solutions for an edge dislocation in a composite material, it is found that the present spectral method is accurate, devoid of any numerical oscillation, and efficient even for an infinite phase elastic contrast like a hole embedded in a matrix containing a dislocation. The present FFT method is then used to simulate physical cases such as the elastic fields of dislocation dipoles located near the matrix/inclusion interface in a 2D composite material and the ones due to dislocation loop distributions surrounding cubic inclusions in 3D composite material. In these configurations, the spectral method allows investigating accurately the elastic interactions and image stresses due to dislocation fields in the presence of elastic inhomogeneities.« less

Field Dislocation Mechanics for heterogeneous elastic materials: A numerical spectral approach

DOE PAGES

Djaka, Komlan Senam; Villani, Aurelien; Taupin, Vincent; ...

2017-03-01

Spectral methods using Fast Fourier Transform (FFT) algorithms have recently seen a surge in interest in the mechanics of materials community. The present work addresses the critical question of determining accurate local mechanical fields using FFT methods without artificial fluctuations arising from materials and defects induced discontinuities. Precisely, this work introduces a numerical approach based on intrinsic discrete Fourier transforms for the simultaneous treatment of material discontinuities arising from the presence of dislocations and from elastic stiffness heterogeneities. To this end, the elasto-static equations of the field dislocation mechanics theory for periodic heterogeneous materials are numerically solved with FFT inmore » the case of dislocations in proximity of inclusions of varying stiffness. An optimal intrinsic discrete Fourier transform method is sought based on two distinct schemes. A centered finite difference scheme for differential rules are used for numerically solving the Poisson-type equation in the Fourier space, while centered finite differences on a rotated grid is chosen for the computation of the modified Fourier–Green’s operator associated with the Lippmann–Schwinger-type equation. By comparing different methods with analytical solutions for an edge dislocation in a composite material, it is found that the present spectral method is accurate, devoid of any numerical oscillation, and efficient even for an infinite phase elastic contrast like a hole embedded in a matrix containing a dislocation. The present FFT method is then used to simulate physical cases such as the elastic fields of dislocation dipoles located near the matrix/inclusion interface in a 2D composite material and the ones due to dislocation loop distributions surrounding cubic inclusions in 3D composite material. In these configurations, the spectral method allows investigating accurately the elastic interactions and image stresses due to dislocation fields in the presence of elastic inhomogeneities.« less

Fuchsia : A tool for reducing differential equations for Feynman master integrals to epsilon form

NASA Astrophysics Data System (ADS)

Gituliar, Oleksandr; Magerya, Vitaly

2017-10-01

We present Fuchsia - an implementation of the Lee algorithm, which for a given system of ordinary differential equations with rational coefficients ∂x J(x , ɛ) = A(x , ɛ) J(x , ɛ) finds a basis transformation T(x , ɛ) , i.e., J(x , ɛ) = T(x , ɛ) J‧(x , ɛ) , such that the system turns into the epsilon form : ∂xJ‧(x , ɛ) = ɛ S(x) J‧(x , ɛ) , where S(x) is a Fuchsian matrix. A system of this form can be trivially solved in terms of polylogarithms as a Laurent series in the dimensional regulator ɛ. That makes the construction of the transformation T(x , ɛ) crucial for obtaining solutions of the initial system. In principle, Fuchsia can deal with any regular systems, however its primary task is to reduce differential equations for Feynman master integrals. It ensures that solutions contain only regular singularities due to the properties of Feynman integrals. Program Files doi:http://dx.doi.org/10.17632/zj6zn9vfkh.1 Licensing provisions: MIT Programming language:Python 2.7 Nature of problem: Feynman master integrals may be calculated from solutions of a linear system of differential equations with rational coefficients. Such a system can be easily solved as an ɛ-series when its epsilon form is known. Hence, a tool which is able to find the epsilon form transformations can be used to evaluate Feynman master integrals. Solution method: The solution method is based on the Lee algorithm (Lee, 2015) which consists of three main steps: fuchsification, normalization, and factorization. During the fuchsification step a given system of differential equations is transformed into the Fuchsian form with the help of the Moser method (Moser, 1959). Next, during the normalization step the system is transformed to the form where eigenvalues of all residues are proportional to the dimensional regulator ɛ. Finally, the system is factorized to the epsilon form by finding an unknown transformation which satisfies a system of linear equations. Additional comments including Restrictions and Unusual features: Systems of single-variable differential equations are considered. A system needs to be reducible to Fuchsian form and eigenvalues of its residues must be of the form n + m ɛ, where n is integer. Performance depends upon the input matrix, its size, number of singular points and their degrees. It takes around an hour to reduce an example 74 × 74 matrix with 20 singular points on a PC with a 1.7 GHz Intel Core i5 CPU. An additional slowdown is to be expected for matrices with complex and/or irrational singular point locations, as these are particularly difficult for symbolic algebra software to handle.

D4Z - a new renumbering for iterative solution of ground-water flow and solute- transport equations

USGS Publications Warehouse

Kipp, K.L.; Russell, T.F.; Otto, J.S.

1992-01-01

D4 zig-zag (D4Z) is a new renumbering scheme for producing a reduced matrix to be solved by an incomplete LU preconditioned, restarted conjugate-gradient iterative solver. By renumbering alternate diagonals in a zig-zag fashion, a very low sensitivity of convergence rate to renumbering direction is obtained. For two demonstration problems involving groundwater flow and solute transport, iteration counts are related to condition numbers and spectra of the reduced matrices.

INTERNATIONAL CONFERENCE ON SEMICONDUCTOR INJECTION LASERS SELCO-87: Transient heat conduction in laser diodes

NASA Astrophysics Data System (ADS)

Enders, P.; Galley, J.

1988-11-01

The dynamics of heat transfer in stripe GaAlAs laser diodes is investigated by solving the linear diffusion equation for a quasitwo-dimensional multilayer structure. The calculations are rationalized drastically by the transfer matrix method and also using for the first time the asymptotes of the decay constants. Special attention is given to the convergence of the Fourier series. A comparison with experimental results reveals however that this is essentially the Stefan problem (with moving boundary conditions).

Complex absorbing potential based Lorentzian fitting scheme and time dependent quantum transport.

PubMed

Xie, Hang; Kwok, Yanho; Jiang, Feng; Zheng, Xiao; Chen, GuanHua

2014-10-28

Based on the complex absorbing potential (CAP) method, a Lorentzian expansion scheme is developed to express the self-energy. The CAP-based Lorentzian expansion of self-energy is employed to solve efficiently the Liouville-von Neumann equation of one-electron density matrix. The resulting method is applicable for both tight-binding and first-principles models and is used to simulate the transient currents through graphene nanoribbons and a benzene molecule sandwiched between two carbon-atom chains.

Domain decomposition methods in aerodynamics

NASA Technical Reports Server (NTRS)

Venkatakrishnan, V.; Saltz, Joel

1990-01-01

Compressible Euler equations are solved for two-dimensional problems by a preconditioned conjugate gradient-like technique. An approximate Riemann solver is used to compute the numerical fluxes to second order accuracy in space. Two ways to achieve parallelism are tested, one which makes use of parallelism inherent in triangular solves and the other which employs domain decomposition techniques. The vectorization/parallelism in triangular solves is realized by the use of a recording technique called wavefront ordering. This process involves the interpretation of the triangular matrix as a directed graph and the analysis of the data dependencies. It is noted that the factorization can also be done in parallel with the wave front ordering. The performances of two ways of partitioning the domain, strips and slabs, are compared. Results on Cray YMP are reported for an inviscid transonic test case. The performances of linear algebra kernels are also reported.

VASP- VARIABLE DIMENSION AUTOMATIC SYNTHESIS PROGRAM

NASA Technical Reports Server (NTRS)

White, J. S.

1994-01-01

VASP is a variable dimension Fortran version of the Automatic Synthesis Program, ASP. The program is used to implement Kalman filtering and control theory. Basically, it consists of 31 subprograms for solving most modern control problems in linear, time-variant (or time-invariant) control systems. These subprograms include operations of matrix algebra, computation of the exponential of a matrix and its convolution integral, and the solution of the matrix Riccati equation. The user calls these subprograms by means of a FORTRAN main program, and so can easily obtain solutions to most general problems of extremization of a quadratic functional of the state of the linear dynamical system. Particularly, these problems include the synthesis of the Kalman filter gains and the optimal feedback gains for minimization of a quadratic performance index. VASP, as an outgrowth of the Automatic Synthesis Program, has the following improvements: more versatile programming language; more convenient input/output format; some new subprograms which consolidate certain groups of statements that are often repeated; and variable dimensioning. The pertinent difference between the two programs is that VASP has variable dimensioning and more efficient storage. The documentation for the VASP program contains a VASP dictionary and example problems. The dictionary contains a description of each subroutine and instructions on its use. The example problems include dynamic response, optimal control gain, solution of the sampled data matrix Riccati equation, matrix decomposition, and a pseudo-inverse of a matrix. This program is written in FORTRAN IV and has been implemented on the IBM 360. The VASP program was developed in 1971.

Efficient Implementation of the Invariant Imbedding T-Matrix Method and the Separation of Variables Method Applied to Large Nonspherical Inhomogeneous Particles

NASA Technical Reports Server (NTRS)

Bi, Lei; Yang, Ping; Kattawar, George W.; Mishchenko, Michael I.

2012-01-01

Three terms, ''Waterman's T-matrix method'', ''extended boundary condition method (EBCM)'', and ''null field method'', have been interchangeable in the literature to indicate a method based on surface integral equations to calculate the T-matrix. Unlike the previous method, the invariant imbedding method (IIM) calculates the T-matrix by the use of a volume integral equation. In addition, the standard separation of variables method (SOV) can be applied to compute the T-matrix of a sphere centered at the origin of the coordinate system and having a maximal radius such that the sphere remains inscribed within a nonspherical particle. This study explores the feasibility of a numerical combination of the IIM and the SOV, hereafter referred to as the IIMþSOV method, for computing the single-scattering properties of nonspherical dielectric particles, which are, in general, inhomogeneous. The IIMþSOV method is shown to be capable of solving light-scattering problems for large nonspherical particles where the standard EBCM fails to converge. The IIMþSOV method is flexible and applicable to inhomogeneous particles and aggregated nonspherical particles (overlapped circumscribed spheres) representing a challenge to the standard superposition T-matrix method. The IIMþSOV computational program, developed in this study, is validated against EBCM simulated spheroid and cylinder cases with excellent numerical agreement (up to four decimal places). In addition, solutions for cylinders with large aspect ratios, inhomogeneous particles, and two-particle systems are compared with results from discrete dipole approximation (DDA) computations, and comparisons with the improved geometric-optics method (IGOM) are found to be quite encouraging.

Groebner Basis Solutions to Satellite Trajectory Control by Pole Placement

NASA Astrophysics Data System (ADS)

Kukelova, Z.; Krsek, P.; Smutny, V.; Pajdla, T.

2013-09-01

Satellites play an important role, e.g., in telecommunication, navigation and weather monitoring. Controlling their trajectories is an important problem. In [1], an approach to the pole placement for the synthesis of a linear controller has been presented. It leads to solving five polynomial equations in nine unknown elements of the state space matrices of a compensator. This is an underconstrained system and therefore four of the unknown elements need to be considered as free parameters and set to some prior values to obtain a system of five equations in five unknowns. In [1], this system was solved for one chosen set of free parameters with the help of Dixon resultants. In this work, we study and present Groebner basis solutions to this problem of computation of a dynamic compensator for the satellite for different combinations of input free parameters. We show that the Groebner basis method for solving systems of polynomial equations leads to very simple solutions for all combinations of free parameters. These solutions require to perform only the Gauss-Jordan elimination of a small matrix and computation of roots of a single variable polynomial. The maximum degree of this polynomial is not greater than six in general but for most combinations of the input free parameters its degree is even lower. [1] B. Palancz. Application of Dixon resultant to satellite trajectory control by pole placement. Journal of Symbolic Computation, Volume 50, March 2013, Pages 79-99, Elsevier.

Exploring inductive linearization for pharmacokinetic-pharmacodynamic systems of nonlinear ordinary differential equations.

PubMed

Hasegawa, Chihiro; Duffull, Stephen B

2018-02-01

Pharmacokinetic-pharmacodynamic systems are often expressed with nonlinear ordinary differential equations (ODEs). While there are numerous methods to solve such ODEs these methods generally rely on time-stepping solutions (e.g. Runge-Kutta) which need to be matched to the characteristics of the problem at hand. The primary aim of this study was to explore the performance of an inductive approximation which iteratively converts nonlinear ODEs to linear time-varying systems which can then be solved algebraically or numerically. The inductive approximation is applied to three examples, a simple nonlinear pharmacokinetic model with Michaelis-Menten elimination (E1), an integrated glucose-insulin model and an HIV viral load model with recursive feedback systems (E2 and E3, respectively). The secondary aim of this study was to explore the potential advantages of analytically solving linearized ODEs with two examples, again E3 with stiff differential equations and a turnover model of luteinizing hormone with a surge function (E4). The inductive linearization coupled with a matrix exponential solution provided accurate predictions for all examples with comparable solution time to the matched time-stepping solutions for nonlinear ODEs. The time-stepping solutions however did not perform well for E4, particularly when the surge was approximated by a square wave. In circumstances when either a linear ODE is particularly desirable or the uncertainty in matching the integrator to the ODE system is of potential risk, then the inductive approximation method coupled with an analytical integration method would be an appropriate alternative.

A Newton-Krylov method with an approximate analytical Jacobian for implicit solution of Navier-Stokes equations on staggered overset-curvilinear grids with immersed boundaries.

PubMed

Asgharzadeh, Hafez; Borazjani, Iman

2017-02-15

The explicit and semi-implicit schemes in flow simulations involving complex geometries and moving boundaries suffer from time-step size restriction and low convergence rates. Implicit schemes can be used to overcome these restrictions, but implementing them to solve the Navier-Stokes equations is not straightforward due to their non-linearity. Among the implicit schemes for nonlinear equations, Newton-based techniques are preferred over fixed-point techniques because of their high convergence rate but each Newton iteration is more expensive than a fixed-point iteration. Krylov subspace methods are one of the most advanced iterative methods that can be combined with Newton methods, i.e., Newton-Krylov Methods (NKMs) to solve non-linear systems of equations. The success of NKMs vastly depends on the scheme for forming the Jacobian, e.g., automatic differentiation is very expensive, and matrix-free methods without a preconditioner slow down as the mesh is refined. A novel, computationally inexpensive analytical Jacobian for NKM is developed to solve unsteady incompressible Navier-Stokes momentum equations on staggered overset-curvilinear grids with immersed boundaries. Moreover, the analytical Jacobian is used to form preconditioner for matrix-free method in order to improve its performance. The NKM with the analytical Jacobian was validated and verified against Taylor-Green vortex, inline oscillations of a cylinder in a fluid initially at rest, and pulsatile flow in a 90 degree bend. The capability of the method in handling complex geometries with multiple overset grids and immersed boundaries is shown by simulating an intracranial aneurysm. It was shown that the NKM with an analytical Jacobian is 1.17 to 14.77 times faster than the fixed-point Runge-Kutta method, and 1.74 to 152.3 times (excluding an intensively stretched grid) faster than automatic differentiation depending on the grid (size) and the flow problem. In addition, it was shown that using only the diagonal of the Jacobian further improves the performance by 42 - 74% compared to the full Jacobian. The NKM with an analytical Jacobian showed better performance than the fixed point Runge-Kutta because it converged with higher time steps and in approximately 30% less iterations even when the grid was stretched and the Reynold number was increased. In fact, stretching the grid decreased the performance of all methods, but the fixed-point Runge-Kutta performance decreased 4.57 and 2.26 times more than NKM with a diagonal Jacobian when the stretching factor was increased, respectively. The NKM with a diagonal analytical Jacobian and matrix-free method with an analytical preconditioner are the fastest methods and the superiority of one to another depends on the flow problem. Furthermore, the implemented methods are fully parallelized with parallel efficiency of 80-90% on the problems tested. The NKM with the analytical Jacobian can guide building preconditioners for other techniques to improve their performance in the future.

A Newton–Krylov method with an approximate analytical Jacobian for implicit solution of Navier–Stokes equations on staggered overset-curvilinear grids with immersed boundaries

PubMed Central

Asgharzadeh, Hafez; Borazjani, Iman

2016-01-01

The explicit and semi-implicit schemes in flow simulations involving complex geometries and moving boundaries suffer from time-step size restriction and low convergence rates. Implicit schemes can be used to overcome these restrictions, but implementing them to solve the Navier-Stokes equations is not straightforward due to their non-linearity. Among the implicit schemes for nonlinear equations, Newton-based techniques are preferred over fixed-point techniques because of their high convergence rate but each Newton iteration is more expensive than a fixed-point iteration. Krylov subspace methods are one of the most advanced iterative methods that can be combined with Newton methods, i.e., Newton-Krylov Methods (NKMs) to solve non-linear systems of equations. The success of NKMs vastly depends on the scheme for forming the Jacobian, e.g., automatic differentiation is very expensive, and matrix-free methods without a preconditioner slow down as the mesh is refined. A novel, computationally inexpensive analytical Jacobian for NKM is developed to solve unsteady incompressible Navier-Stokes momentum equations on staggered overset-curvilinear grids with immersed boundaries. Moreover, the analytical Jacobian is used to form preconditioner for matrix-free method in order to improve its performance. The NKM with the analytical Jacobian was validated and verified against Taylor-Green vortex, inline oscillations of a cylinder in a fluid initially at rest, and pulsatile flow in a 90 degree bend. The capability of the method in handling complex geometries with multiple overset grids and immersed boundaries is shown by simulating an intracranial aneurysm. It was shown that the NKM with an analytical Jacobian is 1.17 to 14.77 times faster than the fixed-point Runge-Kutta method, and 1.74 to 152.3 times (excluding an intensively stretched grid) faster than automatic differentiation depending on the grid (size) and the flow problem. In addition, it was shown that using only the diagonal of the Jacobian further improves the performance by 42 – 74% compared to the full Jacobian. The NKM with an analytical Jacobian showed better performance than the fixed point Runge-Kutta because it converged with higher time steps and in approximately 30% less iterations even when the grid was stretched and the Reynold number was increased. In fact, stretching the grid decreased the performance of all methods, but the fixed-point Runge-Kutta performance decreased 4.57 and 2.26 times more than NKM with a diagonal Jacobian when the stretching factor was increased, respectively. The NKM with a diagonal analytical Jacobian and matrix-free method with an analytical preconditioner are the fastest methods and the superiority of one to another depends on the flow problem. Furthermore, the implemented methods are fully parallelized with parallel efficiency of 80–90% on the problems tested. The NKM with the analytical Jacobian can guide building preconditioners for other techniques to improve their performance in the future. PMID:28042172

A Newton-Krylov method with an approximate analytical Jacobian for implicit solution of Navier-Stokes equations on staggered overset-curvilinear grids with immersed boundaries

NASA Astrophysics Data System (ADS)

Asgharzadeh, Hafez; Borazjani, Iman

2017-02-01

The explicit and semi-implicit schemes in flow simulations involving complex geometries and moving boundaries suffer from time-step size restriction and low convergence rates. Implicit schemes can be used to overcome these restrictions, but implementing them to solve the Navier-Stokes equations is not straightforward due to their non-linearity. Among the implicit schemes for non-linear equations, Newton-based techniques are preferred over fixed-point techniques because of their high convergence rate but each Newton iteration is more expensive than a fixed-point iteration. Krylov subspace methods are one of the most advanced iterative methods that can be combined with Newton methods, i.e., Newton-Krylov Methods (NKMs) to solve non-linear systems of equations. The success of NKMs vastly depends on the scheme for forming the Jacobian, e.g., automatic differentiation is very expensive, and matrix-free methods without a preconditioner slow down as the mesh is refined. A novel, computationally inexpensive analytical Jacobian for NKM is developed to solve unsteady incompressible Navier-Stokes momentum equations on staggered overset-curvilinear grids with immersed boundaries. Moreover, the analytical Jacobian is used to form a preconditioner for matrix-free method in order to improve its performance. The NKM with the analytical Jacobian was validated and verified against Taylor-Green vortex, inline oscillations of a cylinder in a fluid initially at rest, and pulsatile flow in a 90 degree bend. The capability of the method in handling complex geometries with multiple overset grids and immersed boundaries is shown by simulating an intracranial aneurysm. It was shown that the NKM with an analytical Jacobian is 1.17 to 14.77 times faster than the fixed-point Runge-Kutta method, and 1.74 to 152.3 times (excluding an intensively stretched grid) faster than automatic differentiation depending on the grid (size) and the flow problem. In addition, it was shown that using only the diagonal of the Jacobian further improves the performance by 42-74% compared to the full Jacobian. The NKM with an analytical Jacobian showed better performance than the fixed point Runge-Kutta because it converged with higher time steps and in approximately 30% less iterations even when the grid was stretched and the Reynold number was increased. In fact, stretching the grid decreased the performance of all methods, but the fixed-point Runge-Kutta performance decreased 4.57 and 2.26 times more than NKM with a diagonal and full Jacobian, respectivley, when the stretching factor was increased. The NKM with a diagonal analytical Jacobian and matrix-free method with an analytical preconditioner are the fastest methods and the superiority of one to another depends on the flow problem. Furthermore, the implemented methods are fully parallelized with parallel efficiency of 80-90% on the problems tested. The NKM with the analytical Jacobian can guide building preconditioners for other techniques to improve their performance in the future.

Solving the Rational Polynomial Coefficients Based on L Curve

NASA Astrophysics Data System (ADS)

Zhou, G.; Li, X.; Yue, T.; Huang, W.; He, C.; Huang, Y.

2018-05-01

The rational polynomial coefficients (RPC) model is a generalized sensor model, which can achieve high approximation accuracy. And it is widely used in the field of photogrammetry and remote sensing. Least square method is usually used to determine the optimal parameter solution of the rational function model. However the distribution of control points is not uniform or the model is over-parameterized, which leads to the singularity of the coefficient matrix of the normal equation. So the normal equation becomes ill conditioned equation. The obtained solutions are extremely unstable and even wrong. The Tikhonov regularization can effectively improve and solve the ill conditioned equation. In this paper, we calculate pathological equations by regularization method, and determine the regularization parameters by L curve. The results of the experiments on aerial format photos show that the accuracy of the first-order RPC with the equal denominators has the highest accuracy. The high order RPC model is not necessary in the processing of dealing with frame images, as the RPC model and the projective model are almost the same. The result shows that the first-order RPC model is basically consistent with the strict sensor model of photogrammetry. Orthorectification results both the firstorder RPC model and Camera Model (ERDAS9.2 platform) are similar to each other, and the maximum residuals of X and Y are 0.8174 feet and 0.9272 feet respectively. This result shows that RPC model can be used in the aerial photographic compensation replacement sensor model.

Two dimensional J-matrix approach to quantum scattering

NASA Astrophysics Data System (ADS)

Olumegbon, Ismail Adewale

We present an extension of the J-matrix method of scattering to two dimensions in cylindrical coordinates. In the J-matrix approach we select a zeroth order Hamiltonian, H0, which is exactly solvable in the sense that we select a square integrable basis set that enable us to have an infinite tridiagonal representation for H0. Expanding the wavefunction in this basis makes the wave equation equivalent to a three-term recursion relation for the expansion coefficients. Consequently, finding solutions of the recursion relation is equivalent to solving the original H0 problem (i.e., determining the expansion coefficients of the system's wavefunction). The part of the original potential interaction which cannot be brought to an exact tridiagonal form is cut in an NxN basis space and its matrix elements are computed numerically using Gauss quadrature approach. Hence, this approach embodies powerful tools in the analysis of solutions of the wave equation by exploiting the intimate connection and interplay between tridiagonal matrices and the theory of orthogonal polynomials. In such analysis, one is at liberty to employ a wide range of well established methods and numerical techniques associated with these settings such as quadrature approximation and continued fractions. To demonstrate the utility, usefulness, and accuracy of the extended method we use it to obtain the bound states for an illustrative short range potential problem.

Two dimensional J-matrix approach to quantum scattering

NASA Astrophysics Data System (ADS)

Olumegbon, Ismail Adewale

2013-01-01

We present an extension of the J-matrix method of scattering to two dimensions in cylindrical coordinates. In the J-matrix approach we select a zeroth order Hamiltonian, H0, which is exactly solvable in the sense that we select a square integrable basis set that enable us to have an infinite tridiagonal representation for H0. Expanding the wavefunction in this basis makes the wave equation equivalent to a three-term recursion relation for the expansion coefficients. Consequently, finding solutions of the recursion relation is equivalent to solving the original H0 problem (i.e., determining the expansion coefficients of the system's wavefunction). The part of the original potential interaction which cannot be brought to an exact tridiagonal form is cut in an NxN basis space and its matrix elements are computed numerically using Gauss quadrature approach. Hence, this approach embodies powerful tools in the analysis of solutions of the wave equation by exploiting the intimate connection and interplay between tridiagonal matrices and the theory of orthogonal polynomials. In such analysis, one is at liberty to employ a wide range of well established methods and numerical techniques associated with these settings such as quadrature approximation and continued fractions. To demonstrate the utility, usefulness, and accuracy of the extended method we use it to obtain the bound states for an illustrative short range potential problem.

A Model for the Oxidation of Carbon Silicon Carbide Composite Structures

NASA Technical Reports Server (NTRS)

Sullivan, Roy M.

2004-01-01

A mathematical theory and an accompanying numerical scheme have been developed for predicting the oxidation behavior of carbon silicon carbide (C/SiC) composite structures. The theory is derived from the mechanics of the flow of ideal gases through a porous solid. The result of the theoretical formulation is a set of two coupled nonlinear differential equations written in terms of the oxidant and oxide partial pressures. The differential equations are solved simultaneously to obtain the partial vapor pressures of the oxidant and oxides as a function of the spatial location and time. The local rate of carbon oxidation is determined using the map of the local oxidant partial vapor pressure along with the Arrhenius rate equation. The nonlinear differential equations are cast into matrix equations by applying the Bubnov-Galerkin weighted residual method, allowing for the solution of the differential equations numerically. The numerical method is demonstrated by utilizing the method to model the carbon oxidation and weight loss behavior of C/SiC specimens during thermogravimetric experiments. The numerical method is used to study the physics of carbon oxidation in carbon silicon carbide composites.

The Development of a Finite Volume Method for Modeling Sound in Coastal Ocean Environment

DOE Office of Scientific and Technical Information (OSTI.GOV)

Long, Wen; Yang, Zhaoqing; Copping, Andrea E.

: As the rapid growth of marine renewable energy and off-shore wind energy, there have been concerns that the noises generated from construction and operation of the devices may interfere marine animals’ communication. In this research, a underwater sound model is developed to simulate sound prorogation generated by marine-hydrokinetic energy (MHK) devices or offshore wind (OSW) energy platforms. Finite volume and finite difference methods are developed to solve the 3D Helmholtz equation of sound propagation in the coastal environment. For finite volume method, the grid system consists of triangular grids in horizontal plane and sigma-layers in vertical dimension. A 3Dmore » sparse matrix solver with complex coefficients is formed for solving the resulting acoustic pressure field. The Complex Shifted Laplacian Preconditioner (CSLP) method is applied to efficiently solve the matrix system iteratively with MPI parallelization using a high performance cluster. The sound model is then coupled with the Finite Volume Community Ocean Model (FVCOM) for simulating sound propagation generated by human activities in a range-dependent setting, such as offshore wind energy platform constructions and tidal stream turbines. As a proof of concept, initial validation of the finite difference solver is presented for two coastal wedge problems. Validation of finite volume method will be reported separately.« less

Finite-element time evolution operator for the anharmonic oscillator

NASA Technical Reports Server (NTRS)

Milton, Kimball A.

1995-01-01

The finite-element approach to lattice field theory is both highly accurate (relative errors approximately 1/N(exp 2), where N is the number of lattice points) and exactly unitary (in the sense that canonical commutation relations are exactly preserved at the lattice sites). In this talk I construct matrix elements for dynamical variables and for the time evolution operator for the anharmonic oscillator, for which the continuum Hamiltonian is H = p(exp 2)/2 + lambda q(exp 4)/4. Construction of such matrix elements does not require solving the implicit equations of motion. Low order approximations turn out to be extremely accurate. For example, the matrix element of the time evolution operator in the harmonic oscillator ground state gives a results for the anharmonic oscillator ground state energy accurate to better than 1 percent, while a two-state approximation reduces the error to less than 0.1 percent.

Mechanical characterization and modeling of non-linear deformation and fracture of a fiber reinforced metal matrix composite

NASA Technical Reports Server (NTRS)

Jansson, S.

1991-01-01

The nonlinear anisotropic mechanical behavior of an aluminum alloy metal matrix composite reinforced with continuous alumina fibers was determined experimentally. The mechanical behavior of the composite were modeled by assuming that the composite has a periodical microstructure. The resulting unit cell problem was solved with the finite element method. Excellent agreement was found between theoretically predicted and measured stress-strain responses for various tensile and shear loadings. The stress-strain responses for transverse and inplane shear were found to be identical and this will provide a simplification of the constitutive equations for the composite. The composite has a very low ductility in transverse tension and a limited ductility in transverse shear that was correlated to high hydrostatic stresses that develop in the matrix. The shape of the initial yield surface was calculated and good agreement was found between the calculated shape and the experimentally determined shape.

[Series: Utilization of Differential Equations and Methods for Solving Them in Medical Physics (1)].

PubMed

Murase, Kenya

2014-01-01

Utilization of differential equations and methods for solving them in medical physics are presented. First, the basic concept and the kinds of differential equations were overviewed. Second, separable differential equations and well-known first-order and second-order differential equations were introduced, and the methods for solving them were described together with several examples. In the next issue, the symbolic and series expansion methods for solving differential equations will be mainly introduced.

Beating the curse of dimension with accurate statistics for the Fokker-Planck equation in complex turbulent systems.

PubMed

Chen, Nan; Majda, Andrew J

2017-12-05

Solving the Fokker-Planck equation for high-dimensional complex dynamical systems is an important issue. Recently, the authors developed efficient statistically accurate algorithms for solving the Fokker-Planck equations associated with high-dimensional nonlinear turbulent dynamical systems with conditional Gaussian structures, which contain many strong non-Gaussian features such as intermittency and fat-tailed probability density functions (PDFs). The algorithms involve a hybrid strategy with a small number of samples [Formula: see text], where a conditional Gaussian mixture in a high-dimensional subspace via an extremely efficient parametric method is combined with a judicious Gaussian kernel density estimation in the remaining low-dimensional subspace. In this article, two effective strategies are developed and incorporated into these algorithms. The first strategy involves a judicious block decomposition of the conditional covariance matrix such that the evolutions of different blocks have no interactions, which allows an extremely efficient parallel computation due to the small size of each individual block. The second strategy exploits statistical symmetry for a further reduction of [Formula: see text] The resulting algorithms can efficiently solve the Fokker-Planck equation with strongly non-Gaussian PDFs in much higher dimensions even with orders in the millions and thus beat the curse of dimension. The algorithms are applied to a [Formula: see text]-dimensional stochastic coupled FitzHugh-Nagumo model for excitable media. An accurate recovery of both the transient and equilibrium non-Gaussian PDFs requires only [Formula: see text] samples! In addition, the block decomposition facilitates the algorithms to efficiently capture the distinct non-Gaussian features at different locations in a [Formula: see text]-dimensional two-layer inhomogeneous Lorenz 96 model, using only [Formula: see text] samples. Copyright © 2017 the Author(s). Published by PNAS.

Dispersion relations of elastic waves in one-dimensional piezoelectric/piezomagnetic phononic crystal with initial stresses.

PubMed

Guo, Xiao; Wei, Peijun

2016-03-01

The dispersion relations of elastic waves in a one-dimensional phononic crystal formed by periodically repeating of a pre-stressed piezoelectric slab and a pre-stressed piezomagnetic slab are studied in this paper. The influences of initial stress on the dispersive relation are considered based on the incremental stress theory. First, the incremental stress theory of elastic solid is extended to the magneto-electro-elasto solid. The governing equations, constitutive equations, and boundary conditions of the incremental stresses in a magneto-electro-elasto solid are derived with consideration of the existence of initial stresses. Then, the transfer matrices of a pre-stressed piezoelectric slab and a pre-stressed piezomagnetic slab are formulated, respectively. The total transfer matrix of a single cell in the phononic crystal is obtained by the multiplication of two transfer matrixes related with two adjacent slabs. Furthermore, the Bloch theorem is used to obtain the dispersive equations of in-plane and anti-plane Bloch waves. The dispersive equations are solved numerically and the numerical results are shown graphically. The oblique propagation and the normal propagation situations are both considered. In the case of normal propagation of elastic waves, the analytical expressions of the dispersion equation are derived and compared with other literatures. The influences of initial stresses, including the normal initial stresses and shear initial stresses, on the dispersive relations are both discussed based on the numerical results. Copyright © 2015 Elsevier B.V. All rights reserved.

GPU-accelerated element-free reverse-time migration with Gauss points partition

NASA Astrophysics Data System (ADS)

Zhou, Zhen; Jia, Xiaofeng; Qiang, Xiaodong

2018-06-01

An element-free method (EFM) has been demonstrated successfully in elasticity, heat conduction and fatigue crack growth problems. We present the theory of EFM and its numerical applications in seismic modelling and reverse time migration (RTM). Compared with the finite difference method and the finite element method, the EFM has unique advantages: (1) independence of grids in computation and (2) lower expense and more flexibility (because only the information of the nodes and the boundary of the concerned area is required). However, in EFM, due to improper computation and storage of some large sparse matrices, such as the mass matrix and the stiffness matrix, the method is difficult to apply to seismic modelling and RTM for a large velocity model. To solve the problem of storage and computation efficiency, we propose a concept of Gauss points partition and utilise the graphics processing unit to improve the computational efficiency. We employ the compressed sparse row format to compress the intermediate large sparse matrices and attempt to simplify the operations by solving the linear equations with CULA solver. To improve the computation efficiency further, we introduce the concept of the lumped mass matrix. Numerical experiments indicate that the proposed method is accurate and more efficient than the regular EFM.

Efficient Parallel Formulations of Hierarchical Methods and Their Applications

NASA Astrophysics Data System (ADS)

Grama, Ananth Y.

1996-01-01

Hierarchical methods such as the Fast Multipole Method (FMM) and Barnes-Hut (BH) are used for rapid evaluation of potential (gravitational, electrostatic) fields in particle systems. They are also used for solving integral equations using boundary element methods. The linear systems arising from these methods are dense and are solved iteratively. Hierarchical methods reduce the complexity of the core matrix-vector product from O(n^2) to O(n log n) and the memory requirement from O(n^2) to O(n). We have developed highly scalable parallel formulations of a hybrid FMM/BH method that are capable of handling arbitrarily irregular distributions. We apply these formulations to astrophysical simulations of Plummer and Gaussian galaxies. We have used our parallel formulations to solve the integral form of the Laplace equation. We show that our parallel hierarchical mat-vecs yield high efficiency and overall performance even on relatively small problems. A problem containing approximately 200K nodes takes under a second to compute on 256 processors and yet yields over 85% efficiency. The efficiency and raw performance is expected to increase for bigger problems. For the 200K node problem, our code delivers about 5 GFLOPS of performance on a 256 processor T3D. This is impressive considering the fact that the problem has floating point divides and roots, and very little locality resulting in poor cache performance. A dense matrix-vector product of the same dimensions would require about 0.5 TeraBytes of memory and about 770 TeraFLOPS of computing speed. Clearly, if the loss in accuracy resulting from the use of hierarchical methods is acceptable, our code yields significant savings in time and memory. We also study the convergence of a GMRES solver built around this mat-vec. We accelerate the convergence of the solver using three preconditioning techniques: diagonal scaling, block-diagonal preconditioning, and inner-outer preconditioning. We study the performance and parallel efficiency of these preconditioned solvers. Using this solver, we solve dense linear systems with hundreds of thousands of unknowns. Solving a 105K unknown problem takes about 10 minutes on a 64 processor T3D. Until very recently, boundary element problems of this magnitude could not even be generated, let alone solved.

Unstructured Cartesian refinement with sharp interface immersed boundary method for 3D unsteady incompressible flows

NASA Astrophysics Data System (ADS)

Angelidis, Dionysios; Chawdhary, Saurabh; Sotiropoulos, Fotis

2016-11-01

A novel numerical method is developed for solving the 3D, unsteady, incompressible Navier-Stokes equations on locally refined fully unstructured Cartesian grids in domains with arbitrarily complex immersed boundaries. Owing to the utilization of the fractional step method on an unstructured Cartesian hybrid staggered/non-staggered grid layout, flux mismatch and pressure discontinuity issues are avoided and the divergence free constraint is inherently satisfied to machine zero. Auxiliary/hanging nodes are used to facilitate the discretization of the governing equations. The second-order accuracy of the solver is ensured by using multi-dimension Lagrange interpolation operators and appropriate differencing schemes at the interface of regions with different levels of refinement. The sharp interface immersed boundary method is augmented with local near-boundary refinement to handle arbitrarily complex boundaries. The discrete momentum equation is solved with the matrix free Newton-Krylov method and the Krylov-subspace method is employed to solve the Poisson equation. The second-order accuracy of the proposed method on unstructured Cartesian grids is demonstrated by solving the Poisson equation with a known analytical solution. A number of three-dimensional laminar flow simulations of increasing complexity illustrate the ability of the method to handle flows across a range of Reynolds numbers and flow regimes. Laminar steady and unsteady flows past a sphere and the oblique vortex shedding from a circular cylinder mounted between two end walls demonstrate the accuracy, the efficiency and the smooth transition of scales and coherent structures across refinement levels. Large-eddy simulation (LES) past a miniature wind turbine rotor, parameterized using the actuator line approach, indicates the ability of the fully unstructured solver to simulate complex turbulent flows. Finally, a geometry resolving LES of turbulent flow past a complete hydrokinetic turbine illustrates the potential of the method to simulate turbulent flows past geometrically complex bodies on locally refined meshes. In all the cases, the results are found to be in very good agreement with published data and savings in computational resources are achieved.

A finite element code for modelling tracer transport in a non-isothermal two-phase flow system for CO2 geological storage characterization

NASA Astrophysics Data System (ADS)

Tong, F.; Niemi, A. P.; Yang, Z.; Fagerlund, F.; Licha, T.; Sauter, M.

2011-12-01

This paper presents a new finite element method (FEM) code for modeling tracer transport in a non-isothermal two-phase flow system. The main intended application is simulation of the movement of so-called novel tracers for the purpose of characterization of geologically stored CO2 and its phase partitioning and migration in deep saline formations. The governing equations are based on the conservation of mass and energy. Among the phenomena accounted for are liquid-phase flow, gas flow, heat transport and the movement of the novel tracers. The movement of tracers includes diffusion and the advection associated with the gas and liquid flow. The temperature, gas pressure, suction, concentration of tracer in liquid phase and concentration of tracer in gas phase are chosen as the five primary variables. Parameters such as the density, viscosity, thermal expansion coefficient are expressed in terms of the primary variables. The governing equations are discretized in space using the Galerkin finite element formulation, and are discretized in time by one-dimensional finite difference scheme. This leads to an ill-conditioned FEM equation that has many small entries along the diagonal of the non-symmetric coefficient matrix. In order to deal with the problem of non-symmetric ill-conditioned matrix equation, special techniques are introduced . Firstly, only nonzero elements of the matrix need to be stored. Secondly, it is avoided to directly solve the whole large matrix. Thirdly, a strategy has been used to keep the diversity of solution methods in the calculation process. Additionally, an efficient adaptive mesh technique is included in the code in order to track the wetting front. The code has been validated against several classical analytical solutions, and will be applied for simulating the CO2 injection experiment to be carried out at the Heletz site, Israel, as part of the EU FP7 project MUSTANG.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Park, Jong-Kyu; Logan, Nikolas C.

Toroidal torque is one of the most important consequences of non-axisymmetric fields in tokamaks. The well-known neoclassical toroidal viscosity (NTV) is due to the second-order toroidal force from anisotropic pressure tensor in the presence of these asymmetries. This work shows that the first-order toroidal force originating from the same anisotropic pressure tensor, despite having no flux surface average, can significantly modify the local perturbed force balance and thus must be included in perturbed equilibrium self-consistent with NTV. The force operator with an anisotropic pressure tensor is not self-adjoint when the NTV torque is finite and thus is solved directly formore » each component. This approach yields a modified, non-self-adjoint Euler-Lagrange equation that can be solved using a variety of common drift-kinetic models in generalized tokamak geometry. The resulting energy and torque integral provides a unique way to construct a torque response matrix, which contains all the information of self-consistent NTV torque profiles obtainable by applying non-axisymmetric fields to the plasma. This torque response matrix can then be used to systematically optimize non-axisymmetric field distributions for desired NTV profiles. Published by AIP Publishing.« less

Quantum Linear System Algorithm for Dense Matrices

NASA Astrophysics Data System (ADS)

Wossnig, Leonard; Zhao, Zhikuan; Prakash, Anupam

2018-02-01

Solving linear systems of equations is a frequently encountered problem in machine learning and optimization. Given a matrix A and a vector b the task is to find the vector x such that A x =b . We describe a quantum algorithm that achieves a sparsity-independent runtime scaling of O (κ2√{n }polylog(n )/ɛ ) for an n ×n dimensional A with bounded spectral norm, where κ denotes the condition number of A , and ɛ is the desired precision parameter. This amounts to a polynomial improvement over known quantum linear system algorithms when applied to dense matrices, and poses a new state of the art for solving dense linear systems on a quantum computer. Furthermore, an exponential improvement is achievable if the rank of A is polylogarithmic in the matrix dimension. Our algorithm is built upon a singular value estimation subroutine, which makes use of a memory architecture that allows for efficient preparation of quantum states that correspond to the rows of A and the vector of Euclidean norms of the rows of A .

On the non-linear spectroscopy including saturated absorption and four-wave mixing in two and multi-level atoms: a computational study

NASA Astrophysics Data System (ADS)

Patel, M.; De Jager, G.; Nkosi, Z.; Wyngaard, A.; Govender, K.

2017-10-01

In this paper we report on the study of two and multi-level atoms interacting with multiple laser beams. The semi-classical approach is used to describe the system in which the atoms are treated quantum mechanically via the density matrix operator, while the laser beams are treated classically using Maxwells equations. We present results of a two level atom interacting with single and multiple laser beams and demonstrate Rabi oscillations between the levels. The effects of laser modulation on the dynamics of the atom (atomic populations and coherences) are examined by solving the optical Bloch equations. Plots of the density matrix elements as a function of time are presented for various parameters such as laser intensity, detuning, modulation etc. In addition, phase-space plots and Fourier analysis of the density matrix elements are provided. The atomic polarization, estimated from the coherence terms of the density matrix elements, is used in the numerical solution of Maxwells equations to determine the behaviour of the laser beams as they propagate through the atomic ensemble. The effects of saturation and hole-burning are demonstrated in the case of two counter propagating beams with one being a strong beam and the other being very weak. The above work is extended to include four-wave mixing in four level atoms in a diamond configuration. Two co-propagating beams of different wavelengths drive the atoms from a ground state |1〉 to an excited state |3〉 via an intermediate state |2〉. The atoms then move back to the ground state via another intermediate state |4〉, resulting in the generation of two additional correlated photon beams. The characteristics of these additional photons are studied.

Interior radiances in optically deep absorbing media. 1: Exact solutions for one-dimensional model

NASA Technical Reports Server (NTRS)

Kattawar, G. W.; Plass, G. N.

1973-01-01

The exact solutions are obtained for a one dimensional model of a scattering and absorbing medium. The results are given for both the reflected and transmitted radiance for any arbitrary surface albedo as well as for the interior radiance. These same quantities are calculated by the matrix operator method. The relative error of the solutions is obtained by comparison with the exact solutions as well as by an error analysis of the equations. The importance of an accurate starting value for the reflection and transmission operators is shown. A fourth order Runge-Kutta method can be used to solve the differential equations satisfied by these operators in order to obtain such accurate starting values.

Comparison of Several Dissipation Algorithms for Central Difference Schemes

NASA Technical Reports Server (NTRS)

Swanson, R. C.; Radespiel, R.; Turkel, E.

1997-01-01

Several algorithms for introducing artificial dissipation into a central difference approximation to the Euler and Navier Stokes equations are considered. The focus of the paper is on the convective upwind and split pressure (CUSP) scheme, which is designed to support single interior point discrete shock waves. This scheme is analyzed and compared in detail with scalar and matrix dissipation (MATD) schemes. Resolution capability is determined by solving subsonic, transonic, and hypersonic flow problems. A finite-volume discretization and a multistage time-stepping scheme with multigrid are used to compute solutions to the flow equations. Numerical results are also compared with either theoretical solutions or experimental data. For transonic airfoil flows the best accuracy on coarse meshes for aerodynamic coefficients is obtained with a simple MATD scheme.

Code Samples Used for Complexity and Control

NASA Astrophysics Data System (ADS)

Ivancevic, Vladimir G.; Reid, Darryn J.

2015-11-01

The following sections are included: * MathematicaⓇ Code * Generic Chaotic Simulator * Vector Differential Operators * NLS Explorer * 2C++ Code * C++ Lambda Functions for Real Calculus * Accelerometer Data Processor * Simple Predictor-Corrector Integrator * Solving the BVP with the Shooting Method * Linear Hyperbolic PDE Solver * Linear Elliptic PDE Solver * Method of Lines for a Set of the NLS Equations * C# Code * Iterative Equation Solver * Simulated Annealing: A Function Minimum * Simple Nonlinear Dynamics * Nonlinear Pendulum Simulator * Lagrangian Dynamics Simulator * Complex-Valued Crowd Attractor Dynamics * Freeform Fortran Code * Lorenz Attractor Simulator * Complex Lorenz Attractor * Simple SGE Soliton * Complex Signal Presentation * Gaussian Wave Packet * Hermitian Matrices * Euclidean L2-Norm * Vector/Matrix Operations * Plain C-Code: Levenberg-Marquardt Optimizer * Free Basic Code: 2D Crowd Dynamics with 3000 Agents

Scattering and emission from inhomogeneous vegetation canopy and alien target beneath by using three-dimensional vector radiative transfer (3D-VRT) equation

NASA Astrophysics Data System (ADS)

Jin, Ya-Qiu; Liang, Zichang

2005-05-01

To solve the 3D-VRT equation for the model of spatially inhomogeneous scatter media, the finite enclosure of the scatter media is geometrically divided, in both vertical z and transversal (x,y) directions, to form very thin multi-boxes. The zeroth order emission, first-order Mueller matrix of each thin box and an iterative approach of high-order radiative transfer are applied to derive high-order scattering and emission of whole inhomogeneous scatter media. Numerical results of polarized brightness temperature at microwave frequency and under different radiometer resolutions from inhomogeneous scatter model such as vegetation canopy and alien target beneath canopy are simulated and discussed.

A constrained robust least squares approach for contaminant release history identification

NASA Astrophysics Data System (ADS)

Sun, Alexander Y.; Painter, Scott L.; Wittmeyer, Gordon W.

2006-04-01

Contaminant source identification is an important type of inverse problem in groundwater modeling and is subject to both data and model uncertainty. Model uncertainty was rarely considered in the previous studies. In this work, a robust framework for solving contaminant source recovery problems is introduced. The contaminant source identification problem is first cast into one of solving uncertain linear equations, where the response matrix is constructed using a superposition technique. The formulation presented here is general and is applicable to any porous media flow and transport solvers. The robust least squares (RLS) estimator, which originated in the field of robust identification, directly accounts for errors arising from model uncertainty and has been shown to significantly reduce the sensitivity of the optimal solution to perturbations in model and data. In this work, a new variant of RLS, the constrained robust least squares (CRLS), is formulated for solving uncertain linear equations. CRLS allows for additional constraints, such as nonnegativity, to be imposed. The performance of CRLS is demonstrated through one- and two-dimensional test problems. When the system is ill-conditioned and uncertain, it is found that CRLS gave much better performance than its classical counterpart, the nonnegative least squares. The source identification framework developed in this work thus constitutes a reliable tool for recovering source release histories in real applications.

ADM For Solving Linear Second-Order Fredholm Integro-Differential Equations

NASA Astrophysics Data System (ADS)

Karim, Mohd F.; Mohamad, Mahathir; Saifullah Rusiman, Mohd; Che-Him, Norziha; Roslan, Rozaini; Khalid, Kamil

2018-04-01

In this paper, we apply Adomian Decomposition Method (ADM) as numerically analyse linear second-order Fredholm Integro-differential Equations. The approximate solutions of the problems are calculated by Maple package. Some numerical examples have been considered to illustrate the ADM for solving this equation. The results are compared with the existing exact solution. Thus, the Adomian decomposition method can be the best alternative method for solving linear second-order Fredholm Integro-Differential equation. It converges to the exact solution quickly and in the same time reduces computational work for solving the equation. The result obtained by ADM shows the ability and efficiency for solving these equations.

Spinning the fuzzy sphere

DOE Office of Scientific and Technical Information (OSTI.GOV)

Berenstein, David; Dzienkowski, Eric; Lashof-Regas, Robin

Here, we construct various exact analytical solutions of the SO(3) BMN matrix model that correspond to rotating fuzzy spheres and rotating fuzzy tori. These are also solutions of Yang Mills theory compactified on a sphere times time and they are also translationally invariant solutions of the N = 1* field theory with a non-trivial chargedensity. The solutions we construct have a Ζ N symmetry, where N is the rank of the matrices. After an appropriate ansatz, we reduce the problem to solving a set of polynomial equations in 2N real variables. These equations have a discrete set of solutions formore » each value of the angular momentum. We study the phase structure of the solutions for various values of N . Also the continuum limit where N → ∞, where the problem reduces to finding periodic solutions of a set of coupled differential equations. We also study the topology change transition from the sphere to the torus.« less

On scattering from the one-dimensional multiple Dirac delta potentials

NASA Astrophysics Data System (ADS)

Erman, Fatih; Gadella, Manuel; Uncu, Haydar

2018-05-01

In this paper, we propose a pedagogical presentation of the Lippmann–Schwinger equation as a powerful tool, so as to obtain important scattering information. In particular, we consider a one-dimensional system with a Schrödinger-type free Hamiltonian decorated with a sequence of N attractive Dirac delta interactions. We first write the Lippmann–Schwinger equation for the system and then solve it explicitly in terms of an N × N matrix. Then, we discuss the reflection and the transmission coefficients for an arbitrary number of centres and study the threshold anomaly for the N = 2 and N = 4 cases. We also study further features like the quantum metastable states and resonances, including their corresponding Gamow functions and virtual or antibound states. The use of the Lippmann–Schwinger equation simplifies our analysis enormously and gives exact results for an arbitrary number of Dirac delta potentials.

Spinning the fuzzy sphere

DOE PAGES

Berenstein, David; Dzienkowski, Eric; Lashof-Regas, Robin

2015-08-27

Here, we construct various exact analytical solutions of the SO(3) BMN matrix model that correspond to rotating fuzzy spheres and rotating fuzzy tori. These are also solutions of Yang Mills theory compactified on a sphere times time and they are also translationally invariant solutions of the N = 1* field theory with a non-trivial chargedensity. The solutions we construct have a Ζ N symmetry, where N is the rank of the matrices. After an appropriate ansatz, we reduce the problem to solving a set of polynomial equations in 2N real variables. These equations have a discrete set of solutions formore » each value of the angular momentum. We study the phase structure of the solutions for various values of N . Also the continuum limit where N → ∞, where the problem reduces to finding periodic solutions of a set of coupled differential equations. We also study the topology change transition from the sphere to the torus.« less

A GPU-based incompressible Navier-Stokes solver on moving overset grids

NASA Astrophysics Data System (ADS)

Chandar, Dominic D. J.; Sitaraman, Jayanarayanan; Mavriplis, Dimitri J.

2013-07-01

In pursuit of obtaining high fidelity solutions to the fluid flow equations in a short span of time, graphics processing units (GPUs) which were originally intended for gaming applications are currently being used to accelerate computational fluid dynamics (CFD) codes. With a high peak throughput of about 1 TFLOPS on a PC, GPUs seem to be favourable for many high-resolution computations. One such computation that involves a lot of number crunching is computing time accurate flow solutions past moving bodies. The aim of the present paper is thus to discuss the development of a flow solver on unstructured and overset grids and its implementation on GPUs. In its present form, the flow solver solves the incompressible fluid flow equations on unstructured/hybrid/overset grids using a fully implicit projection method. The resulting discretised equations are solved using a matrix-free Krylov solver using several GPU kernels such as gradient, Laplacian and reduction. Some of the simple arithmetic vector calculations are implemented using the CU++: An Object Oriented Framework for Computational Fluid Dynamics Applications using Graphics Processing Units, Journal of Supercomputing, 2013, doi:10.1007/s11227-013-0985-9 approach where GPU kernels are automatically generated at compile time. Results are presented for two- and three-dimensional computations on static and moving grids.

Convergence Acceleration of Runge-Kutta Schemes for Solving the Navier-Stokes Equations

NASA Technical Reports Server (NTRS)

Swanson, Roy C., Jr.; Turkel, Eli; Rossow, C.-C.

2007-01-01

The convergence of a Runge-Kutta (RK) scheme with multigrid is accelerated by preconditioning with a fully implicit operator. With the extended stability of the Runge-Kutta scheme, CFL numbers as high as 1000 can be used. The implicit preconditioner addresses the stiffness in the discrete equations associated with stretched meshes. This RK/implicit scheme is used as a smoother for multigrid. Fourier analysis is applied to determine damping properties. Numerical dissipation operators based on the Roe scheme, a matrix dissipation, and the CUSP scheme are considered in evaluating the RK/implicit scheme. In addition, the effect of the number of RK stages is examined. Both the numerical and computational efficiency of the scheme with the different dissipation operators are discussed. The RK/implicit scheme is used to solve the two-dimensional (2-D) and three-dimensional (3-D) compressible, Reynolds-averaged Navier-Stokes equations. Turbulent flows over an airfoil and wing at subsonic and transonic conditions are computed. The effects of the cell aspect ratio on convergence are investigated for Reynolds numbers between 5:7 x 10(exp 6) and 100 x 10(exp 6). It is demonstrated that the implicit preconditioner can reduce the computational time of a well-tuned standard RK scheme by a factor between four and ten.

Finite Volume Element (FVE) discretization and multilevel solution of the axisymmetric heat equation

NASA Astrophysics Data System (ADS)

Litaker, Eric T.

1994-12-01

The axisymmetric heat equation, resulting from a point-source of heat applied to a metal block, is solved numerically; both iterative and multilevel solutions are computed in order to compare the two processes. The continuum problem is discretized in two stages: finite differences are used to discretize the time derivatives, resulting is a fully implicit backward time-stepping scheme, and the Finite Volume Element (FVE) method is used to discretize the spatial derivatives. The application of the FVE method to a problem in cylindrical coordinates is new, and results in stencils which are analyzed extensively. Several iteration schemes are considered, including both Jacobi and Gauss-Seidel; a thorough analysis of these schemes is done, using both the spectral radii of the iteration matrices and local mode analysis. Using this discretization, a Gauss-Seidel relaxation scheme is used to solve the heat equation iteratively. A multilevel solution process is then constructed, including the development of intergrid transfer and coarse grid operators. Local mode analysis is performed on the components of the amplification matrix, resulting in the two-level convergence factors for various combinations of the operators. A multilevel solution process is implemented by using multigrid V-cycles; the iterative and multilevel results are compared and discussed in detail. The computational savings resulting from the multilevel process are then discussed.

Scilab software as an alternative low-cost computing in solving the linear equations problem

NASA Astrophysics Data System (ADS)

Agus, Fahrul; Haviluddin

2017-02-01

Numerical computation packages are widely used both in teaching and research. These packages consist of license (proprietary) and open source software (non-proprietary). One of the reasons to use the package is a complexity of mathematics function (i.e., linear problems). Also, number of variables in a linear or non-linear function has been increased. The aim of this paper was to reflect on key aspects related to the method, didactics and creative praxis in the teaching of linear equations in higher education. If implemented, it could be contribute to a better learning in mathematics area (i.e., solving simultaneous linear equations) that essential for future engineers. The focus of this study was to introduce an additional numerical computation package of Scilab as an alternative low-cost computing programming. In this paper, Scilab software was proposed some activities that related to the mathematical models. In this experiment, four numerical methods such as Gaussian Elimination, Gauss-Jordan, Inverse Matrix, and Lower-Upper Decomposition (LU) have been implemented. The results of this study showed that a routine or procedure in numerical methods have been created and explored by using Scilab procedures. Then, the routine of numerical method that could be as a teaching material course has exploited.

Multiscale modeling of localized resistive heating in nanocrystalline metals subjected to electropulsing

NASA Astrophysics Data System (ADS)

Zhao, Jingyi; Wang, G.-X.; Dong, Yalin; Ye, Chang

2017-08-01

Many electrically assisted processes have been reported to induce changes in microstructure and metal plasticity. To understand the physics-based mechanisms behind these interesting phenomena, however, requires an understanding of the interaction between the electric current and heterogeneous microstructure. In this work, multiscale modeling of the electric current flow in a nanocrystalline material is reported. The cellular automata method was used to track the nanoscale grain boundaries in the matrix. Maxwell's electromagnetic equations were solved to obtain the electrical potential distribution at the macro scale. Kirchhoff's circuit equation was solved to obtain the electric current flow at the micro/nano scale. The electric current distribution at two representative locations was investigated. A significant electric current concentration was observed near the grain boundaries, particularly near the triple junctions. This higher localized electric current leads to localized resistive heating near the grain boundaries. The electric current distribution could be used to obtain critical information such as localized resistive heating rate and extra system free energy, which are critical for explaining many interesting phenomena, including microstructure evolution and plasticity enhancement in many electrically assisted processes.

Three-scale analysis of the permeability of a natural shale

NASA Astrophysics Data System (ADS)

Davy, C. A.; Adler, P. M.

2017-12-01

The macroscopic permeability of a natural shale is determined by using structural measurements on three different scales. Transmission electron microscopy yields two-dimensional (2D) images with pixels smaller than 1 nm; these images are used to reconstruct 3D nanostructures. Three-dimensional focused ion beam-scanning electron microscopy (5.95- to 8.48-nm voxel size) provides 3D mesoscale pores of limited relative volume (1.71-5.9%). Micro-computed tomography (700-nm voxel size) provides information on the mineralogy of the shale, including the pores on this scale which do not percolate; synthetic 3D media are derived on the macroscopic scale by a training image technique. Permeability of the nanoscale, of the mesoscale structures and of their superposition is determined by solving the Stokes equation and this enables us to estimate the permeabilities of the 700-nm voxels located within the clay matrix. Finally, the Darcy equation is solved on synthetic 3D macroscale media to obtain the macroscopic permeability which is found in good agreement with experimental results obtained on the centimetric scale.

Curvilinear immersed-boundary method for simulating unsteady flows in shallow natural streams with arbitrarily complex obstacles

NASA Astrophysics Data System (ADS)

Kang, Seokkoo; Borazjani, Iman; Sotiropoulos, Fotis

2008-11-01

Unsteady 3D simulations of flows in natural streams is a challenging task due to the complexity of the bathymetry, the shallowness of the flow, and the presence of multiple nature- and man-made obstacles. This work is motivated by the need to develop a powerful numerical method for simulating such flows using coherent-structure-resolving turbulence models. We employ the curvilinear immersed boundary method of Ge and Sotiropoulos (Journal of Computational Physics, 2007) and address the critical issue of numerical efficiency in large aspect ratio computational domains and grids such as those encountered in long and shallow open channels. We show that the matrix-free Newton-Krylov method for solving the momentum equations coupled with an algebraic multigrid method with incomplete LU preconditioner for solving the Poisson equation yield a robust and efficient procedure for obtaining time-accurate solutions in such problems. We demonstrate the potential of the numerical approach by carrying out a direct numerical simulation of flow in a long and shallow meandering stream with multiple hydraulic structures.

Cognitive Load in Algebra: Element Interactivity in Solving Equations

ERIC Educational Resources Information Center

Ngu, Bing Hiong; Chung, Siu Fung; Yeung, Alexander Seeshing

2015-01-01

Central to equation solving is the maintenance of equivalence on both sides of the equation. However, when the process involves an interaction of multiple elements, solving an equation can impose a high cognitive load. The balance method requires operations on both sides of the equation, whereas the inverse method involves operations on one side…

Estimating the Inertia Matrix of a Spacecraft

NASA Technical Reports Server (NTRS)

Acikmese, Behcet; Keim, Jason; Shields, Joel

2007-01-01

A paper presents a method of utilizing some flight data, aboard a spacecraft that includes reaction wheels for attitude control, to estimate the inertia matrix of the spacecraft. The required data are digitized samples of (1) the spacecraft attitude in an inertial reference frame as measured, for example, by use of a star tracker and (2) speeds of rotation of the reaction wheels, the moments of inertia of which are deemed to be known. Starting from the classical equations for conservation of angular momentum of a rigid body, the inertia-matrix-estimation problem is formulated as a constrained least-squares minimization problem with explicit bounds on the inertia matrix incorporated as linear matrix inequalities. The explicit bounds reflect physical bounds on the inertia matrix and reduce the volume of data that must be processed to obtain a solution. The resulting minimization problem is a semidefinite optimization problem that can be solved efficiently, with guaranteed convergence to the global optimum, by use of readily available algorithms. In a test case involving a model attitude platform rotating on an air bearing, it is shown that, relative to a prior method, the present method produces better estimates from few data.

Solving large test-day models by iteration on data and preconditioned conjugate gradient.

PubMed

Lidauer, M; Strandén, I; Mäntysaari, E A; Pösö, J; Kettunen, A

1999-12-01

A preconditioned conjugate gradient method was implemented into an iteration on a program for data estimation of breeding values, and its convergence characteristics were studied. An algorithm was used as a reference in which one fixed effect was solved by Gauss-Seidel method, and other effects were solved by a second-order Jacobi method. Implementation of the preconditioned conjugate gradient required storing four vectors (size equal to number of unknowns in the mixed model equations) in random access memory and reading the data at each round of iteration. The preconditioner comprised diagonal blocks of the coefficient matrix. Comparison of algorithms was based on solutions of mixed model equations obtained by a single-trait animal model and a single-trait, random regression test-day model. Data sets for both models used milk yield records of primiparous Finnish dairy cows. Animal model data comprised 665,629 lactation milk yields and random regression test-day model data of 6,732,765 test-day milk yields. Both models included pedigree information of 1,099,622 animals. The animal model ¿random regression test-day model¿ required 122 ¿305¿ rounds of iteration to converge with the reference algorithm, but only 88 ¿149¿ were required with the preconditioned conjugate gradient. To solve the random regression test-day model with the preconditioned conjugate gradient required 237 megabytes of random access memory and took 14% of the computation time needed by the reference algorithm.

Using an internal coordinate Gaussian basis and a space-fixed Cartesian coordinate kinetic energy operator to compute a vibrational spectrum with rectangular collocation.

PubMed

Manzhos, Sergei; Carrington, Tucker

2016-12-14

We demonstrate that it is possible to use basis functions that depend on curvilinear internal coordinates to compute vibrational energy levels without deriving a kinetic energy operator (KEO) and without numerically computing coefficients of a KEO. This is done by using a space-fixed KEO and computing KEO matrix elements numerically. Whenever one has an excellent basis, more accurate solutions to the Schrödinger equation can be obtained by computing the KEO, potential, and overlap matrix elements numerically. Using a Gaussian basis and bond coordinates, we compute vibrational energy levels of formaldehyde. We show, for the first time, that it is possible with a Gaussian basis to solve a six-dimensional vibrational Schrödinger equation. For the zero-point energy (ZPE) and the lowest 50 vibrational transitions of H 2 CO, we obtain a mean absolute error of less than 1 cm -1 ; with 200 000 collocation points and 40 000 basis functions, most errors are less than 0.4 cm -1 .

Using an internal coordinate Gaussian basis and a space-fixed Cartesian coordinate kinetic energy operator to compute a vibrational spectrum with rectangular collocation

NASA Astrophysics Data System (ADS)

Manzhos, Sergei; Carrington, Tucker

2016-12-01

We demonstrate that it is possible to use basis functions that depend on curvilinear internal coordinates to compute vibrational energy levels without deriving a kinetic energy operator (KEO) and without numerically computing coefficients of a KEO. This is done by using a space-fixed KEO and computing KEO matrix elements numerically. Whenever one has an excellent basis, more accurate solutions to the Schrödinger equation can be obtained by computing the KEO, potential, and overlap matrix elements numerically. Using a Gaussian basis and bond coordinates, we compute vibrational energy levels of formaldehyde. We show, for the first time, that it is possible with a Gaussian basis to solve a six-dimensional vibrational Schrödinger equation. For the zero-point energy (ZPE) and the lowest 50 vibrational transitions of H2CO, we obtain a mean absolute error of less than 1 cm-1; with 200 000 collocation points and 40 000 basis functions, most errors are less than 0.4 cm-1.

An extended GS method for dense linear systems

NASA Astrophysics Data System (ADS)

Niki, Hiroshi; Kohno, Toshiyuki; Abe, Kuniyoshi

2009-09-01

Davey and Rosindale [K. Davey, I. Rosindale, An iterative solution scheme for systems of boundary element equations, Internat. J. Numer. Methods Engrg. 37 (1994) 1399-1411] derived the GSOR method, which uses an upper triangular matrix [Omega] in order to solve dense linear systems. By applying functional analysis, the authors presented an expression for the optimum [Omega]. Moreover, Davey and Bounds [K. Davey, S. Bounds, A generalized SOR method for dense linear systems of boundary element equations, SIAM J. Comput. 19 (1998) 953-967] also introduced further interesting results. In this note, we employ a matrix analysis approach to investigate these schemes, and derive theorems that compare these schemes with existing preconditioners for dense linear systems. We show that the convergence rate of the Gauss-Seidel method with preconditioner PG is superior to that of the GSOR method. Moreover, we define some splittings associated with the iterative schemes. Some numerical examples are reported to confirm the theoretical analysis. We show that the EGS method with preconditioner produces an extremely small spectral radius in comparison with the other schemes considered.

Learning the inverse kinetics of an octopus-like manipulator in three-dimensional space.

PubMed

Giorelli, M; Renda, F; Calisti, M; Arienti, A; Ferri, G; Laschi, C

2015-05-13

This work addresses the inverse kinematics problem of a bioinspired octopus-like manipulator moving in three-dimensional space. The bioinspired manipulator has a conical soft structure that confers the ability of twirling around objects as a real octopus arm does. Despite the simple design, the soft conical shape manipulator driven by cables is described by nonlinear differential equations, which are difficult to solve analytically. Since exact solutions of the equations are not available, the Jacobian matrix cannot be calculated analytically and the classical iterative methods cannot be used. To overcome the intrinsic problems of methods based on the Jacobian matrix, this paper proposes a neural network learning the inverse kinematics of a soft octopus-like manipulator driven by cables. After the learning phase, a feed-forward neural network is able to represent the relation between manipulator tip positions and forces applied to the cables. Experimental results show that a desired tip position can be achieved in a short time, since heavy computations are avoided, with a degree of accuracy of 8% relative average error with respect to the total arm length.

Computing ordinary least-squares parameter estimates for the National Descriptive Model of Mercury in Fish

USGS Publications Warehouse

Donato, David I.

2013-01-01

A specialized technique is used to compute weighted ordinary least-squares (OLS) estimates of the parameters of the National Descriptive Model of Mercury in Fish (NDMMF) in less time using less computer memory than general methods. The characteristics of the NDMMF allow the two products X'X and X'y in the normal equations to be filled out in a second or two of computer time during a single pass through the N data observations. As a result, the matrix X does not have to be stored in computer memory and the computationally expensive matrix multiplications generally required to produce X'X and X'y do not have to be carried out. The normal equations may then be solved to determine the best-fit parameters in the OLS sense. The computational solution based on this specialized technique requires O(8p2+16p) bytes of computer memory for p parameters on a machine with 8-byte double-precision numbers. This publication includes a reference implementation of this technique and a Gaussian-elimination solver in preliminary custom software.

Kinematics of an in-parallel actuated manipulator based on the Stewart platform mechanism

NASA Technical Reports Server (NTRS)

Williams, Robert L., II

1992-01-01

This paper presents kinematic equations and solutions for an in-parallel actuated robotic mechanism based on Stewart's platform. These equations are required for inverse position and resolved rate (inverse velocity) platform control. NASA LaRC has a Vehicle Emulator System (VES) platform designed by MIT which is based on Stewart's platform. The inverse position solution is straight-forward and computationally inexpensive. Given the desired position and orientation of the moving platform with respect to the base, the lengths of the prismatic leg actuators are calculated. The forward position solution is more complicated and theoretically has 16 solutions. The position and orientation of the moving platform with respect to the base is calculated given the leg actuator lengths. Two methods are pursued in this paper to solve this problem. The resolved rate (inverse velocity) solution is derived. Given the desired Cartesian velocity of the end-effector, the required leg actuator rates are calculated. The Newton-Raphson Jacobian matrix resulting from the second forward position kinematics solution is a modified inverse Jacobian matrix. Examples and simulations are given for the VES.

Two Legendre-Dual-Petrov-Galerkin Algorithms for Solving the Integrated Forms of High Odd-Order Boundary Value Problems

PubMed Central

Abd-Elhameed, Waleed M.; Doha, Eid H.; Bassuony, Mahmoud A.

2014-01-01

Two numerical algorithms based on dual-Petrov-Galerkin method are developed for solving the integrated forms of high odd-order boundary value problems (BVPs) governed by homogeneous and nonhomogeneous boundary conditions. Two different choices of trial functions and test functions which satisfy the underlying boundary conditions of the differential equations and the dual boundary conditions are used for this purpose. These choices lead to linear systems with specially structured matrices that can be efficiently inverted, hence greatly reducing the cost. The various matrix systems resulting from these discretizations are carefully investigated, especially their complexities and their condition numbers. Numerical results are given to illustrate the efficiency of the proposed algorithms, and some comparisons with some other methods are made. PMID:24616620

An empirical investigation of methods for nonsymmetric linear systems

NASA Technical Reports Server (NTRS)

Sherman, A. H.

1981-01-01

The present investigation is concerned with a comparison of methods for solving linear algebraic systems which arise from finite difference discretizations of the elliptic convection-diffusion equation in a planar region Omega with Dirichlet boundary conditions. Such linear systems are typically of the form Ax = b where A is an N x N sparse nonsymmetric matrix. In a discussion of discretizations, it is assumed that a regular rectilinear mesh of width h has been imposed on Omega. The discretizations considered include central differences, upstream differences, and modified upstream differences. Six methods for solving Ax = b are considered. Three variants of Gaussian elimination have been chosen as representatives of state-of-the-art software for direct methods under different assumptions about pivoting. Three iterative methods are also included.

Polarizing Grids, their Assemblies and Beams of Radiation

NASA Technical Reports Server (NTRS)

Houde, Martin; Akeson, Rachel L.; Carlstrom, John E.; Lamb, James W.; Schleuning, David A.; Woody, David P.

2001-01-01

This article gives an analysis of the behavior of polarizing grids and reflecting polarizers by solving Maxwell's equations, for arbitrary angles of incidence and grid rotation, for cases where the excitation is provided by an incident plane wave or a beam of radiation. The scattering and impedance matrix representations are derived and used to solve more complicated configurations of grid assemblies. The results are also compared with data obtained in the calibration of reflecting polarizers at the Owens Valley Radio Observatory (OVRO). From these analysis, we propose a method for choosing the optimum grid parameters (wire radius and spacing). We also provide a study of the effects of two types of errors (in wire separation and radius size) that can be introduced in the fabrication of a grid.

On supporting students' understanding of solving linear equation by using flowchart

NASA Astrophysics Data System (ADS)

Toyib, Muhamad; Kusmayadi, Tri Atmojo; Riyadi

2017-05-01

The aim of this study was to support 7th graders to gradually understand the concepts and procedures of solving linear equation. Thirty-two 7th graders of a Junior High School in Surakarta, Indonesia were involved in this study. Design research was used as the research approach to achieve the aim. A set of learning activities in solving linear equation with one unknown were designed based on Realistic Mathematics Education (RME) approach. The activities were started by playing LEGO to find a linear equation then solve the equation by using flowchart. The results indicate that using the realistic problems, playing LEGO could stimulate students to construct linear equation. Furthermore, Flowchart used to encourage students' reasoning and understanding on the concepts and procedures of solving linear equation with one unknown.

Complex quantum Hamilton-Jacobi equation with Bohmian trajectories: Application to the photodissociation dynamics of NOCl

DOE Office of Scientific and Technical Information (OSTI.GOV)

Chou, Chia-Chun, E-mail: ccchou@mx.nthu.edu.tw

2014-03-14

The complex quantum Hamilton-Jacobi equation-Bohmian trajectories (CQHJE-BT) method is introduced as a synthetic trajectory method for integrating the complex quantum Hamilton-Jacobi equation for the complex action function by propagating an ensemble of real-valued correlated Bohmian trajectories. Substituting the wave function expressed in exponential form in terms of the complex action into the time-dependent Schrödinger equation yields the complex quantum Hamilton-Jacobi equation. We transform this equation into the arbitrary Lagrangian-Eulerian version with the grid velocity matching the flow velocity of the probability fluid. The resulting equation describing the rate of change in the complex action transported along Bohmian trajectories is simultaneouslymore » integrated with the guidance equation for Bohmian trajectories, and the time-dependent wave function is readily synthesized. The spatial derivatives of the complex action required for the integration scheme are obtained by solving one moving least squares matrix equation. In addition, the method is applied to the photodissociation of NOCl. The photodissociation dynamics of NOCl can be accurately described by propagating a small ensemble of trajectories. This study demonstrates that the CQHJE-BT method combines the considerable advantages of both the real and the complex quantum trajectory methods previously developed for wave packet dynamics.« less

Convection equation modeling: A non-iterative direct matrix solution algorithm for use with SINDA

NASA Technical Reports Server (NTRS)

Schrage, Dean S.

1993-01-01

The determination of the boundary conditions for a component-level analysis, applying discrete finite element and finite difference modeling techniques often requires an analysis of complex coupled phenomenon that cannot be described algebraically. For example, an analysis of the temperature field of a coldplate surface with an integral fluid loop requires a solution to the parabolic heat equation and also requires the boundary conditions that describe the local fluid temperature. However, the local fluid temperature is described by a convection equation that can only be solved with the knowledge of the locally-coupled coldplate temperatures. Generally speaking, it is not computationally efficient, and sometimes, not even possible to perform a direct, coupled phenomenon analysis of the component-level and boundary condition models within a single analysis code. An alternative is to perform a disjoint analysis, but transmit the necessary information between models during the simulation to provide an indirect coupling. For this approach to be effective, the component-level model retains full detail while the boundary condition model is simplified to provide a fast, first-order prediction of the phenomenon in question. Specifically for the present study, the coldplate structure is analyzed with a discrete, numerical model (SINDA) while the fluid loop convection equation is analyzed with a discrete, analytical model (direct matrix solution). This indirect coupling allows a satisfactory prediction of the boundary condition, while not subjugating the overall computational efficiency of the component-level analysis. In the present study a discussion of the complete analysis of the derivation and direct matrix solution algorithm of the convection equation is presented. Discretization is analyzed and discussed to extend of solution accuracy, stability and computation speed. Case studies considering a pulsed and harmonic inlet disturbance to the fluid loop are analyzed to assist in the discussion of numerical dissipation and accuracy. In addition, the issues of code melding or integration with standard class solvers such as SINDA are discussed to advise the user of the potential problems to be encountered.

Aerodynamic Shape Sensitivity Analysis and Design Optimization of Complex Configurations Using Unstructured Grids

NASA Technical Reports Server (NTRS)

Taylor, Arthur C., III; Newman, James C., III; Barnwell, Richard W.

1997-01-01

A three-dimensional unstructured grid approach to aerodynamic shape sensitivity analysis and design optimization has been developed and is extended to model geometrically complex configurations. The advantage of unstructured grids (when compared with a structured-grid approach) is their inherent ability to discretize irregularly shaped domains with greater efficiency and less effort. Hence, this approach is ideally suited for geometrically complex configurations of practical interest. In this work the nonlinear Euler equations are solved using an upwind, cell-centered, finite-volume scheme. The discrete, linearized systems which result from this scheme are solved iteratively by a preconditioned conjugate-gradient-like algorithm known as GMRES for the two-dimensional geometry and a Gauss-Seidel algorithm for the three-dimensional; similar procedures are used to solve the accompanying linear aerodynamic sensitivity equations in incremental iterative form. As shown, this particular form of the sensitivity equation makes large-scale gradient-based aerodynamic optimization possible by taking advantage of memory efficient methods to construct exact Jacobian matrix-vector products. Simple parameterization techniques are utilized for demonstrative purposes. Once the surface has been deformed, the unstructured grid is adapted by considering the mesh as a system of interconnected springs. Grid sensitivities are obtained by differentiating the surface parameterization and the grid adaptation algorithms with ADIFOR (which is an advanced automatic-differentiation software tool). To demonstrate the ability of this procedure to analyze and design complex configurations of practical interest, the sensitivity analysis and shape optimization has been performed for a two-dimensional high-lift multielement airfoil and for a three-dimensional Boeing 747-200 aircraft.

Finite elements and the method of conjugate gradients on a concurrent processor

NASA Technical Reports Server (NTRS)

Lyzenga, G. A.; Raefsky, A.; Hager, G. H.

1985-01-01

An algorithm for the iterative solution of finite element problems on a concurrent processor is presented. The method of conjugate gradients is used to solve the system of matrix equations, which is distributed among the processors of a MIMD computer according to an element-based spatial decomposition. This algorithm is implemented in a two-dimensional elastostatics program on the Caltech Hypercube concurrent processor. The results of tests on up to 32 processors show nearly linear concurrent speedup, with efficiencies over 90 percent for sufficiently large problems.

Relation between the celestial reference system and the terrestrial reference system of a rigid earth

NASA Astrophysics Data System (ADS)

Aoki, Shinko

The equations of motion for a rigid earth under the influence of the sun and moon are solved analytically up to the second-order perturbation, and the results are used to elucidate the relationship between the celestial and terrestrial reference systems. The derivations are given in detail, and consideration is given to celestial-ephemeris and instantaneous-rotation poles, wobble, the departure point as the origin of the local inertial system, the precession-nutation matrix, and techniques for improving the celestial reference system.

Finite elements and the method of conjugate gradients on a concurrent processor

NASA Technical Reports Server (NTRS)

Lyzenga, G. A.; Raefsky, A.; Hager, B. H.

1984-01-01

An algorithm for the iterative solution of finite element problems on a concurrent processor is presented. The method of conjugate gradients is used to solve the system of matrix equations, which is distributed among the processors of a MIMD computer according to an element-based spatial decomposition. This algorithm is implemented in a two-dimensional elastostatics program on the Caltech Hypercube concurrent processor. The results of tests on up to 32 processors show nearly linear concurrent speedup, with efficiencies over 90% for sufficiently large problems.

Nonlinear Deformation of a Piecewise Homogeneous Cylinder Under the Action of Rotation

NASA Astrophysics Data System (ADS)

Akhundov, V. M.; Kostrova, M. M.

2018-05-01

Deformation of a piecewise cylinder under the action of rotation is investigated. The cylinder consists of an elastic matrix with circular fibers of square cross section made of a more rigid elastic material and arranged doubly periodically in the cylinder. Behavior of the cylinder under large displacements and deformations is examined using the equations of a nonlinear elasticity theory for cylinder constituents. The problem posed is solved by the finite-difference method using the method of continuation with respect to the rotational speed of the cylinder.

Stress-intensity factors of r-cracks in fiber-reinforced composites under thermal and mechanical loading

NASA Astrophysics Data System (ADS)

Mueller, W. H.; Schmauder, S.

1993-02-01

The plane stress/plane strain problem of radial matrix cracking in fiber-reinforced composites, due to thermal mismatch and externally applied stress is solved numerically in the framework of linear elasticity, using Erdogan's integral equation technique. It is shown that, in order to obtain the results of the combined loading case, the solutions of purely thermal and purely mechanical loading can simply be superimposed. Stress-intensity factors are calculated for various lengths and distances of the crack from the interface for each of these loading conditions.

A binomial stochastic kinetic approach to the Michaelis-Menten mechanism

NASA Astrophysics Data System (ADS)

Lente, Gábor

2013-05-01

This Letter presents a new method that gives an analytical approximation of the exact solution of the stochastic Michaelis-Menten mechanism without computationally demanding matrix operations. The method is based on solving the deterministic rate equations and then using the results as guiding variables of calculating probability values using binomial distributions. This principle can be generalized to a number of different kinetic schemes and is expected to be very useful in the evaluation of measurements focusing on the catalytic activity of one or a few individual enzyme molecules.

On thermalization of electron-positron-photon plasma

NASA Astrophysics Data System (ADS)

Siutsou, I. A.; Aksenov, A. G.; Vereshchagin, G. V.

2015-12-01

Recently a progress has been made in understanding thermalization mechanism of relativistic plasma starting from a non-equilibrium state. Relativistic Boltzmann equations were solved numerically for homogeneous isotropic plasma with collision integrals for two- and three-particle interactions calculated from the first principles by means of QED matrix elements. All particles were assumed to fulfill Boltzmann statistics. In this work we follow plasma thermalization by accounting for Bose enhancement and Pauli blocking in particle interactions. Our results show that particle in equilibrium reach Bose-Einstein distribution for photons, and Fermi-Dirac one for electrons, respectively.

Fundamental characteristics of degradation-recoverable solid-state DFB polymer laser.

PubMed

Yoshioka, Hiroaki; Yang, Yu; Watanabe, Hirofumi; Oki, Yuji

2012-02-13

A novel solid-state dye laser with degradation recovery was proposed and demonstrated. Polydimethylsiloxane was used as a nanoporous solid matrix to enable the internal circulation of dye molecules in the solid state. An internal circulation model for the dye molecules was also proposed and verified numerically by assuming molecular mobility and using a proposed diffusion equation. The durability of the laser was increased 20.5-fold compared with that of a conventional polymethylmethacrylate laser. This novel laser solves the low-durability problem of dye-doped polymer lasers.

Inversion of very large matrices encountered in large scale problems of photogrammetry and photographic astrometry

NASA Technical Reports Server (NTRS)

Brown, D. C.

1971-01-01

The simultaneous adjustment of very large nets of overlapping plates covering the celestial sphere becomes computationally feasible by virtue of a twofold process that generates a system of normal equations having a bordered-banded coefficient matrix, and solves such a system in a highly efficient manner. Numerical results suggest that when a well constructed spherical net is subjected to a rigorous, simultaneous adjustment, the exercise of independently established control points is neither required for determinancy nor for production of accurate results.

Some conservative estimates in quantum cryptography

DOE Office of Scientific and Technical Information (OSTI.GOV)

Molotkov, S. N.

2006-08-15

Relationship is established between the security of the BB84 quantum key distribution protocol and the forward and converse coding theorems for quantum communication channels. The upper bound Q{sub c} {approx} 11% on the bit error rate compatible with secure key distribution is determined by solving the transcendental equation H(Q{sub c})=C-bar({rho})/2, where {rho} is the density matrix of the input ensemble, C-bar({rho}) is the classical capacity of a noiseless quantum channel, and H(Q) is the capacity of a classical binary symmetric channel with error rate Q.

Students' Equation Understanding and Solving in Iran

ERIC Educational Resources Information Center

Barahmand, Ali; Shahvarani, Ahmad

2014-01-01

The purpose of the present article is to investigate how 15-year-old Iranian students interpret the concept of equation, its solution, and studying the relation between the students' equation understanding and solving. Data from two equation-solving exercises are reported. Data analysis shows that there is a significant relationship between…

Eye Movements Reveal Students' Strategies in Simple Equation Solving

ERIC Educational Resources Information Center

Susac, Ana; Bubic, Andreja; Kaponja, Jurica; Planinic, Maja; Palmovic, Marijan

2014-01-01

Equation rearrangement is an important skill required for problem solving in mathematics and science. Eye movements of 40 university students were recorded while they were rearranging simple algebraic equations. The participants also reported on their strategies during equation solving in a separate questionnaire. The analysis of the behavioral…

Time dependent Schrödinger equation for black hole evaporation: No information loss

DOE Office of Scientific and Technical Information (OSTI.GOV)

Corda, Christian, E-mail: cordac.galilei@gmail.com

2015-02-15

In 1976 S. Hawking claimed that “Because part of the information about the state of the system is lost down the hole, the final situation is represented by a density matrix rather than a pure quantum state”. This was the starting point of the popular “black hole (BH) information paradox”. In a series of papers, together with collaborators, we naturally interpreted BH quasi-normal modes (QNMs) in terms of quantum levels discussing a model of excited BH somewhat similar to the historical semi-classical Bohr model of the structure of a hydrogen atom. Here we explicitly write down, for the same model,more » a time dependent Schrödinger equation for the system composed by Hawking radiation and BH QNMs. The physical state and the correspondent wave function are written in terms of a unitary evolution matrix instead of a density matrix. Thus, the final state results to be a pure quantum state instead of a mixed one. Hence, Hawking’s claim is falsified because BHs result to be well defined quantum mechanical systems, having ordered, discrete quantum spectra, which respect ’t Hooft’s assumption that Schrödinger equations can be used universally for all dynamics in the universe. As a consequence, information comes out in BH evaporation in terms of pure states in a unitary time dependent evolution. In Section 4 of this paper we show that the present approach permits also to solve the entanglement problem connected with the information paradox.« less

A fully Sinc-Galerkin method for Euler-Bernoulli beam models

NASA Technical Reports Server (NTRS)

Smith, R. C.; Bowers, K. L.; Lund, J.

1990-01-01

A fully Sinc-Galerkin method in both space and time is presented for fourth-order time-dependent partial differential equations with fixed and cantilever boundary conditions. The Sinc discretizations for the second-order temporal problem and the fourth-order spatial problems are presented. Alternate formulations for variable parameter fourth-order problems are given which prove to be especially useful when applying the forward techniques to parameter recovery problems. The discrete system which corresponds to the time-dependent partial differential equations of interest are then formulated. Computational issues are discussed and a robust and efficient algorithm for solving the resulting matrix system is outlined. Numerical results which highlight the method are given for problems with both analytic and singular solutions as well as fixed and cantilever boundary conditions.

SIERRA - A 3-D device simulator for reliability modeling

NASA Astrophysics Data System (ADS)

Chern, Jue-Hsien; Arledge, Lawrence A., Jr.; Yang, Ping; Maeda, John T.

1989-05-01

SIERRA is a three-dimensional general-purpose semiconductor-device simulation program which serves as a foundation for investigating integrated-circuit (IC) device and reliability issues. This program solves the Poisson and continuity equations in silicon under dc, transient, and small-signal conditions. Executing on a vector/parallel minisupercomputer, SIERRA utilizes a matrix solver which uses an incomplete LU (ILU) preconditioned conjugate gradient square (CGS, BCG) method. The ILU-CGS method provides a good compromise between memory size and convergence rate. The authors have observed a 5x to 7x speedup over standard direct methods in simulations of transient problems containing highly coupled Poisson and continuity equations such as those found in reliability-oriented simulations. The application of SIERRA to parasitic CMOS latchup and dynamic random-access memory single-event-upset studies is described.

A three-dimensional wide-angle BPM for optical waveguide structures.

PubMed

Ma, Changbao; Van Keuren, Edward

2007-01-22

Algorithms for effective modeling of optical propagation in three- dimensional waveguide structures are critical for the design of photonic devices. We present a three-dimensional (3-D) wide-angle beam propagation method (WA-BPM) using Hoekstra's scheme. A sparse matrix algebraic equation is formed and solved using iterative methods. The applicability, accuracy and effectiveness of our method are demonstrated by applying it to simulations of wide-angle beam propagation, along with a technique for shifting the simulation window to reduce the dimension of the numerical equation and a threshold technique to further ensure its convergence. These techniques can ensure the implementation of iterative methods for waveguide structures by relaxing the convergence problem, which will further enable us to develop higher-order 3-D WA-BPMs based on Padé approximant operators.

A three-dimensional wide-angle BPM for optical waveguide structures

NASA Astrophysics Data System (ADS)

Ma, Changbao; van Keuren, Edward

2007-01-01

Algorithms for effective modeling of optical propagation in three- dimensional waveguide structures are critical for the design of photonic devices. We present a three-dimensional (3-D) wide-angle beam propagation method (WA-BPM) using Hoekstra’s scheme. A sparse matrix algebraic equation is formed and solved using iterative methods. The applicability, accuracy and effectiveness of our method are demonstrated by applying it to simulations of wide-angle beam propagation, along with a technique for shifting the simulation window to reduce the dimension of the numerical equation and a threshold technique to further ensure its convergence. These techniques can ensure the implementation of iterative methods for waveguide structures by relaxing the convergence problem, which will further enable us to develop higher-order 3-D WA-BPMs based on Padé approximant operators.

Solvable Hydrodynamics of Quantum Integrable Systems

NASA Astrophysics Data System (ADS)

Bulchandani, Vir B.; Vasseur, Romain; Karrasch, Christoph; Moore, Joel E.

2017-12-01

The conventional theory of hydrodynamics describes the evolution in time of chaotic many-particle systems from local to global equilibrium. In a quantum integrable system, local equilibrium is characterized by a local generalized Gibbs ensemble or equivalently a local distribution of pseudomomenta. We study time evolution from local equilibria in such models by solving a certain kinetic equation, the "Bethe-Boltzmann" equation satisfied by the local pseudomomentum density. Explicit comparison with density matrix renormalization group time evolution of a thermal expansion in the XXZ model shows that hydrodynamical predictions from smooth initial conditions can be remarkably accurate, even for small system sizes. Solutions are also obtained in the Lieb-Liniger model for free expansion into vacuum and collisions between clouds of particles, which model experiments on ultracold one-dimensional Bose gases.

Method of mechanical quadratures for solving singular integral equations of various types

NASA Astrophysics Data System (ADS)

Sahakyan, A. V.; Amirjanyan, H. A.

2018-04-01

The method of mechanical quadratures is proposed as a common approach intended for solving the integral equations defined on finite intervals and containing Cauchy-type singular integrals. This method can be used to solve singular integral equations of the first and second kind, equations with generalized kernel, weakly singular equations, and integro-differential equations. The quadrature rules for several different integrals represented through the same coefficients are presented. This allows one to reduce the integral equations containing integrals of different types to a system of linear algebraic equations.

Computation of steady and unsteady quasi-one-dimensional viscous/inviscid interacting internal flows at subsonic, transonic, and supersonic Mach numbers

NASA Technical Reports Server (NTRS)

Swafford, Timothy W.; Huddleston, David H.; Busby, Judy A.; Chesser, B. Lawrence

1992-01-01

Computations of viscous-inviscid interacting internal flowfields are presented for steady and unsteady quasi-one-dimensional (Q1D) test cases. The unsteady Q1D Euler equations are coupled with integral boundary-layer equations for unsteady, two-dimensional (planar or axisymmetric), turbulent flow over impermeable, adiabatic walls. The coupling methodology differs from that used in most techniques reported previously in that the above mentioned equation sets are written as a complete system and solved simultaneously; that is, the coupling is carried out directly through the equations as opposed to coupling the solutions of the different equation sets. Solutions to the coupled system of equations are obtained using both explicit and implicit numerical schemes for steady subsonic, steady transonic, and both steady and unsteady supersonic internal flowfields. Computed solutions are compared with measurements as well as Navier-Stokes and inverse boundary-layer methods. An analysis of the eigenvalues of the coefficient matrix associated with the quasi-linear form of the coupled system of equations indicates the presence of complex eigenvalues for certain flow conditions. It is concluded that although reasonable solutions can be obtained numerically, these complex eigenvalues contribute to the overall difficulty in obtaining numerical solutions to the coupled system of equations.

State-vector formalism and the Legendre polynomial solution for modelling guided waves in anisotropic plates

NASA Astrophysics Data System (ADS)

Zheng, Mingfang; He, Cunfu; Lu, Yan; Wu, Bin

2018-01-01

We presented a numerical method to solve phase dispersion curve in general anisotropic plates. This approach involves an exact solution to the problem in the form of the Legendre polynomial of multiple integrals, which we substituted into the state-vector formalism. In order to improve the efficiency of the proposed method, we made a special effort to demonstrate the analytical methodology. Furthermore, we analyzed the algebraic symmetries of the matrices in the state-vector formalism for anisotropic plates. The basic feature of the proposed method was the expansion of field quantities by Legendre polynomials. The Legendre polynomial method avoid to solve the transcendental dispersion equation, which can only be solved numerically. This state-vector formalism combined with Legendre polynomial expansion distinguished the adjacent dispersion mode clearly, even when the modes were very close. We then illustrated the theoretical solutions of the dispersion curves by this method for isotropic and anisotropic plates. Finally, we compared the proposed method with the global matrix method (GMM), which shows excellent agreement.

Learning SVM in Kreĭn Spaces.

PubMed

Loosli, Gaelle; Canu, Stephane; Ong, Cheng Soon

2016-06-01

This paper presents a theoretical foundation for an SVM solver in Kreĭn spaces. Up to now, all methods are based either on the matrix correction, or on non-convex minimization, or on feature-space embedding. Here we justify and evaluate a solution that uses the original (indefinite) similarity measure, in the original Kreĭn space. This solution is the result of a stabilization procedure. We establish the correspondence between the stabilization problem (which has to be solved) and a classical SVM based on minimization (which is easy to solve). We provide simple equations to go from one to the other (in both directions). This link between stabilization and minimization problems is the key to obtain a solution in the original Kreĭn space. Using KSVM, one can solve SVM with usually troublesome kernels (large negative eigenvalues or large numbers of negative eigenvalues). We show experiments showing that our algorithm KSVM outperforms all previously proposed approaches to deal with indefinite matrices in SVM-like kernel methods.

A Galleria Boundary Element Method for two-dimensional nonlinear magnetostatics

NASA Astrophysics Data System (ADS)

Brovont, Aaron D.

The Boundary Element Method (BEM) is a numerical technique for solving partial differential equations that is used broadly among the engineering disciplines. The main advantage of this method is that one needs only to mesh the boundary of a solution domain. A key drawback is the myriad of integrals that must be evaluated to populate the full system matrix. To this day these integrals have been evaluated using numerical quadrature. In this research, a Galerkin formulation of the BEM is derived and implemented to solve two-dimensional magnetostatic problems with a focus on accurate, rapid computation. To this end, exact, closed-form solutions have been derived for all the integrals comprising the system matrix as well as those required to compute fields in post-processing; the need for numerical integration has been eliminated. It is shown that calculation of the system matrix elements using analytical solutions is 15-20 times faster than with numerical integration of similar accuracy. Furthermore, through the example analysis of a c-core inductor, it is demonstrated that the present BEM formulation is a competitive alternative to the Finite Element Method (FEM) for linear magnetostatic analysis. Finally, the BEM formulation is extended to analyze nonlinear magnetostatic problems via the Dual Reciprocity Method (DRBEM). It is shown that a coarse, meshless analysis using the DRBEM is able to achieve RMS error of 3-6% compared to a commercial FEM package in lightly saturated conditions.

A numerical solution for the diffusion equation in hydrogeologic systems

USGS Publications Warehouse

Ishii, A.L.; Healy, R.W.; Striegl, Robert G.

1989-01-01

The documentation of a computer code for the numerical solution of the linear diffusion equation in one or two dimensions in Cartesian or cylindrical coordinates is presented. Applications of the program include molecular diffusion, heat conduction, and fluid flow in confined systems. The flow media may be anisotropic and heterogeneous. The model is formulated by replacing the continuous linear diffusion equation by discrete finite-difference approximations at each node in a block-centered grid. The resulting matrix equation is solved by the method of preconditioned conjugate gradients. The conjugate gradient method does not require the estimation of iteration parameters and is guaranteed convergent in the absence of rounding error. The matrixes are preconditioned to decrease the steps to convergence. The model allows the specification of any number of boundary conditions for any number of stress periods, and the output of a summary table for selected nodes showing flux and the concentration of the flux quantity for each time step. The model is written in a modular format for ease of modification. The model was verified by comparison of numerical and analytical solutions for cases of molecular diffusion, two-dimensional heat transfer, and axisymmetric radial saturated fluid flow. Application of the model to a hypothetical two-dimensional field situation of gas diffusion in the unsaturated zone is demonstrated. The input and output files are included as a check on program installation. The definition of variables, input requirements, flow chart, and program listing are included in the attachments. (USGS)

An algorithm for the solution of dynamic linear programs

NASA Technical Reports Server (NTRS)

Psiaki, Mark L.

1989-01-01

The algorithm's objective is to efficiently solve Dynamic Linear Programs (DLP) by taking advantage of their special staircase structure. This algorithm constitutes a stepping stone to an improved algorithm for solving Dynamic Quadratic Programs, which, in turn, would make the nonlinear programming method of Successive Quadratic Programs more practical for solving trajectory optimization problems. The ultimate goal is to being trajectory optimization solution speeds into the realm of real-time control. The algorithm exploits the staircase nature of the large constraint matrix of the equality-constrained DLPs encountered when solving inequality-constrained DLPs by an active set approach. A numerically-stable, staircase QL factorization of the staircase constraint matrix is carried out starting from its last rows and columns. The resulting recursion is like the time-varying Riccati equation from multi-stage LQR theory. The resulting factorization increases the efficiency of all of the typical LP solution operations over that of a dense matrix LP code. At the same time numerical stability is ensured. The algorithm also takes advantage of dynamic programming ideas about the cost-to-go by relaxing active pseudo constraints in a backwards sweeping process. This further decreases the cost per update of the LP rank-1 updating procedure, although it may result in more changes of the active set that if pseudo constraints were relaxed in a non-stagewise fashion. The usual stability of closed-loop Linear/Quadratic optimally-controlled systems, if it carries over to strictly linear cost functions, implies that the saving due to reduced factor update effort may outweigh the cost of an increased number of updates. An aerospace example is presented in which a ground-to-ground rocket's distance is maximized. This example demonstrates the applicability of this class of algorithms to aerospace guidance. It also sheds light on the efficacy of the proposed pseudo constraint relaxation scheme.

Solving the linear inviscid shallow water equations in one dimension, with variable depth, using a recursion formula

NASA Astrophysics Data System (ADS)

Hernandez-Walls, R.; Martín-Atienza, B.; Salinas-Matus, M.; Castillo, J.

2017-11-01

When solving the linear inviscid shallow water equations with variable depth in one dimension using finite differences, a tridiagonal system of equations must be solved. Here we present an approach, which is more efficient than the commonly used numerical method, to solve this tridiagonal system of equations using a recursion formula. We illustrate this approach with an example in which we solve for a rectangular channel to find the resonance modes. Our numerical solution agrees very well with the analytical solution. This new method is easy to use and understand by undergraduate students, so it can be implemented in undergraduate courses such as Numerical Methods, Lineal Algebra or Differential Equations.

The generalised Sylvester matrix equations over the generalised bisymmetric and skew-symmetric matrices

NASA Astrophysics Data System (ADS)

Dehghan, Mehdi; Hajarian, Masoud

2012-08-01

A matrix P is called a symmetric orthogonal if P = P T = P -1. A matrix X is said to be a generalised bisymmetric with respect to P if X = X T = PXP. It is obvious that any symmetric matrix is also a generalised bisymmetric matrix with respect to I (identity matrix). By extending the idea of the Jacobi and the Gauss-Seidel iterations, this article proposes two new iterative methods, respectively, for computing the generalised bisymmetric (containing symmetric solution as a special case) and skew-symmetric solutions of the generalised Sylvester matrix equation ? (including Sylvester and Lyapunov matrix equations as special cases) which is encountered in many systems and control applications. When the generalised Sylvester matrix equation has a unique generalised bisymmetric (skew-symmetric) solution, the first (second) iterative method converges to the generalised bisymmetric (skew-symmetric) solution of this matrix equation for any initial generalised bisymmetric (skew-symmetric) matrix. Finally, some numerical results are given to illustrate the effect of the theoretical results.

Accurate Solution of Multi-Region Continuum Biomolecule Electrostatic Problems Using the Linearized Poisson-Boltzmann Equation with Curved Boundary Elements

PubMed Central

Altman, Michael D.; Bardhan, Jaydeep P.; White, Jacob K.; Tidor, Bruce

2009-01-01

We present a boundary-element method (BEM) implementation for accurately solving problems in biomolecular electrostatics using the linearized Poisson–Boltzmann equation. Motivating this implementation is the desire to create a solver capable of precisely describing the geometries and topologies prevalent in continuum models of biological molecules. This implementation is enabled by the synthesis of four technologies developed or implemented specifically for this work. First, molecular and accessible surfaces used to describe dielectric and ion-exclusion boundaries were discretized with curved boundary elements that faithfully reproduce molecular geometries. Second, we avoided explicitly forming the dense BEM matrices and instead solved the linear systems with a preconditioned iterative method (GMRES), using a matrix compression algorithm (FFTSVD) to accelerate matrix-vector multiplication. Third, robust numerical integration methods were employed to accurately evaluate singular and near-singular integrals over the curved boundary elements. Finally, we present a general boundary-integral approach capable of modeling an arbitrary number of embedded homogeneous dielectric regions with differing dielectric constants, possible salt treatment, and point charges. A comparison of the presented BEM implementation and standard finite-difference techniques demonstrates that for certain classes of electrostatic calculations, such as determining absolute electrostatic solvation and rigid-binding free energies, the improved convergence properties of the BEM approach can have a significant impact on computed energetics. We also demonstrate that the improved accuracy offered by the curved-element BEM is important when more sophisticated techniques, such as non-rigid-binding models, are used to compute the relative electrostatic effects of molecular modifications. In addition, we show that electrostatic calculations requiring multiple solves using the same molecular geometry, such as charge optimization or component analysis, can be computed to high accuracy using the presented BEM approach, in compute times comparable to traditional finite-difference methods. PMID:18567005

Efficient implementation of three-dimensional reference interaction site model self-consistent-field method: Application to solvatochromic shift calculations

NASA Astrophysics Data System (ADS)

Minezawa, Noriyuki; Kato, Shigeki

2007-02-01

The authors present an implementation of the three-dimensional reference interaction site model self-consistent-field (3D-RISM-SCF) method. First, they introduce a robust and efficient algorithm for solving the 3D-RISM equation. The algorithm is a hybrid of the Newton-Raphson and Picard methods. The Jacobian matrix is analytically expressed in a computationally useful form. Second, they discuss the solute-solvent electrostatic interaction. For the solute to solvent route, the electrostatic potential (ESP) map on a 3D grid is constructed directly from the electron density. The charge fitting procedure is not required to determine the ESP. For the solvent to solute route, the ESP acting on the solute molecule is derived from the solvent charge distribution obtained by solving the 3D-RISM equation. Matrix elements of the solute-solvent interaction are evaluated by the direct numerical integration. A remarkable reduction in the computational time is observed in both routes. Finally, the authors implement the first derivatives of the free energy with respect to the solute nuclear coordinates. They apply the present method to "solute" water and formaldehyde in aqueous solvent using the simple point charge model, and the results are compared with those from other methods: the six-dimensional molecular Ornstein-Zernike SCF, the one-dimensional site-site RISM-SCF, and the polarizable continuum model. The authors also calculate the solvatochromic shifts of acetone, benzonitrile, and nitrobenzene using the present method and compare them with the experimental and other theoretical results.

Efficient implementation of three-dimensional reference interaction site model self-consistent-field method: application to solvatochromic shift calculations.

PubMed

Minezawa, Noriyuki; Kato, Shigeki

2007-02-07

The authors present an implementation of the three-dimensional reference interaction site model self-consistent-field (3D-RISM-SCF) method. First, they introduce a robust and efficient algorithm for solving the 3D-RISM equation. The algorithm is a hybrid of the Newton-Raphson and Picard methods. The Jacobian matrix is analytically expressed in a computationally useful form. Second, they discuss the solute-solvent electrostatic interaction. For the solute to solvent route, the electrostatic potential (ESP) map on a 3D grid is constructed directly from the electron density. The charge fitting procedure is not required to determine the ESP. For the solvent to solute route, the ESP acting on the solute molecule is derived from the solvent charge distribution obtained by solving the 3D-RISM equation. Matrix elements of the solute-solvent interaction are evaluated by the direct numerical integration. A remarkable reduction in the computational time is observed in both routes. Finally, the authors implement the first derivatives of the free energy with respect to the solute nuclear coordinates. They apply the present method to "solute" water and formaldehyde in aqueous solvent using the simple point charge model, and the results are compared with those from other methods: the six-dimensional molecular Ornstein-Zernike SCF, the one-dimensional site-site RISM-SCF, and the polarizable continuum model. The authors also calculate the solvatochromic shifts of acetone, benzonitrile, and nitrobenzene using the present method and compare them with the experimental and other theoretical results.

Temperature dependence of the intensity of the vibration-rotational absorption band ν2 of H2O trapped in an argon matrix

NASA Astrophysics Data System (ADS)

Pitsevich, G.; Doroshenko, I.; Malevich, A..; Shalamberidze, E.; Sapeshko, V.; Pogorelov, V.; Pettersson, L. G. M.

2017-02-01

Using two sets of effective rotational constants for the ground (000) and the excited bending (010) vibrational states the calculation of frequencies and intensities of vibration-rotational transitions for J″ = 0 - 2; and J‧ = 0 - 3; was carried out in frame of the model of a rigid asymmetric top for temperatures from 0 to 40 K. The calculation of the intensities of vibration-rotational absorption bands of H2O in an Ar matrix was carried out both for thermodynamic equilibrium and for the case of non-equilibrium population of para- and ortho-states. For the analysis of possible interaction of vibration-rotational and translational motions of a water molecule in an Ar matrix by 3D Schrödinger equation solving using discrete variable representation (DVR) method, calculations of translational frequencies of H2O in a cage formed after one argon atom deleting were carried out. The results of theoretical calculations were compared to experimental data taken from literature.

Interacting quasi-band model for electronic states in compound semiconductor alloys: Zincblende structure

NASA Astrophysics Data System (ADS)

Shinozuka, Yuzo; Oda, Masato

2015-09-01

The interacting quasi-band model proposed for electronic states in simple alloys is extended for compound semiconductor alloys with general lattice structures containing several atoms per unit cell. Using a tight-binding model, a variational electronic wave function for quasi-Bloch states yields a non-Hermitian Hamiltonian matrix characterized by matrix elements of constituent crystals and concentration of constituents. Solving secular equations for each k-state yields the alloy’s energy spectrum for any type of randomness and arbitrary concentration. The theory is used to address III-V (II-VI) alloys with a zincblende lattice with crystal band structures well represented by the sp3s* model. Using the resulting 15 × 15 matrix, the concentration dependence of valence and conduction bands is calculated in a unified scheme for typical alloys: Al1-xGaxAs, GaAs1-xPx, and GaSb1-xPx. Results agree well with experiments and are discussed with respect to the concentration dependence, direct-indirect gap transition, and band-gap-bowing origin.

On statistical independence of a contingency matrix

NASA Astrophysics Data System (ADS)

Tsumoto, Shusaku; Hirano, Shoji

2005-03-01

A contingency table summarizes the conditional frequencies of two attributes and shows how these two attributes are dependent on each other with the information on a partition of universe generated by these attributes. Thus, this table can be viewed as a relation between two attributes with respect to information granularity. This paper focuses on several characteristics of linear and statistical independence in a contingency table from the viewpoint of granular computing, which shows that statistical independence in a contingency table is a special form of linear dependence. The discussions also show that when a contingency table is viewed as a matrix, called a contingency matrix, its rank is equal to 1.0. Thus, the degree of independence, rank plays a very important role in extracting a probabilistic model from a given contingency table. Furthermore, it is found that in some cases, partial rows or columns will satisfy the condition of statistical independence, which can be viewed as a solving process of Diophatine equations.

Algorithm 937: MINRES-QLP for Symmetric and Hermitian Linear Equations and Least-Squares Problems.

PubMed

Choi, Sou-Cheng T; Saunders, Michael A

2014-02-01

We describe algorithm MINRES-QLP and its FORTRAN 90 implementation for solving symmetric or Hermitian linear systems or least-squares problems. If the system is singular, MINRES-QLP computes the unique minimum-length solution (also known as the pseudoinverse solution), which generally eludes MINRES. In all cases, it overcomes a potential instability in the original MINRES algorithm. A positive-definite pre-conditioner may be supplied. Our FORTRAN 90 implementation illustrates a design pattern that allows users to make problem data known to the solver but hidden and secure from other program units. In particular, we circumvent the need for reverse communication. Example test programs input and solve real or complex problems specified in Matrix Market format. While we focus here on a FORTRAN 90 implementation, we also provide and maintain MATLAB versions of MINRES and MINRES-QLP.

Two-dimensional grid-free compressive beamforming.

PubMed

Yang, Yang; Chu, Zhigang; Xu, Zhongming; Ping, Guoli

2017-08-01

Compressive beamforming realizes the direction-of-arrival (DOA) estimation and strength quantification of acoustic sources by solving an underdetermined system of equations relating microphone pressures to a source distribution via compressive sensing. The conventional method assumes DOAs of sources to lie on a grid. Its performance degrades due to basis mismatch when the assumption is not satisfied. To overcome this limitation for the measurement with plane microphone arrays, a two-dimensional grid-free compressive beamforming is developed. First, a continuum based atomic norm minimization is defined to denoise the measured pressure and thus obtain the pressure from sources. Next, a positive semidefinite programming is formulated to approximate the atomic norm minimization. Subsequently, a reasonably fast algorithm based on alternating direction method of multipliers is presented to solve the positive semidefinite programming. Finally, the matrix enhancement and matrix pencil method is introduced to process the obtained pressure and reconstruct the source distribution. Both simulations and experiments demonstrate that under certain conditions, the grid-free compressive beamforming can provide high-resolution and low-contamination imaging, allowing accurate and fast estimation of two-dimensional DOAs and quantification of source strengths, even with non-uniform arrays and noisy measurements.

Self-consistent perturbed equilibrium with neoclassical toroidal torque in tokamaks

DOE PAGES

Park, Jong-Kyu; Logan, Nikolas C.

2017-03-01

Toroidal torque is one of the most important consequences of non-axisymmetric fields in tokamaks. The well-known neoclassical toroidal viscosity (NTV) is due to the second-order toroidal force from anisotropic pressure tensor in the presence of these asymmetries. This work shows that the first-order toroidal force originating from the same anisotropic pressure tensor, despite having no flux surface average, can significantly modify the local perturbed force balance and thus must be included in perturbed equilibrium self-consistent with NTV. The force operator with an anisotropic pressure tensor is not self-adjoint when the NTV torque is finite and thus is solved directly formore » each component. This approach yields a modified, non-self-adjoint Euler-Lagrange equation that can be solved using a variety of common drift-kinetic models in generalized tokamak geometry. The resulting energy and torque integral provides a unique way to construct a torque response matrix, which contains all the information of self-consistent NTV torque profiles obtainable by applying non-axisymmetric fields to the plasma. This torque response matrix can then be used to systematically optimize non-axisymmetric field distributions for desired NTV profiles. Published by AIP Publishing.« less

Open-Source Software for Modeling of Nanoelectronic Devices

NASA Technical Reports Server (NTRS)

Oyafuso, Fabiano; Hua, Hook; Tisdale, Edwin; Hart, Don

2004-01-01

The Nanoelectronic Modeling 3-D (NEMO 3-D) computer program has been upgraded to open-source status through elimination of license-restricted components. The present version functions equivalently to the version reported in "Software for Numerical Modeling of Nanoelectronic Devices" (NPO-30520), NASA Tech Briefs, Vol. 27, No. 11 (November 2003), page 37. To recapitulate: NEMO 3-D performs numerical modeling of the electronic transport and structural properties of a semiconductor device that has overall dimensions of the order of tens of nanometers. The underlying mathematical model represents the quantum-mechanical behavior of the device resolved to the atomistic level of granularity. NEMO 3-D solves the applicable quantum matrix equation on a Beowulf-class cluster computer by use of a parallel-processing matrix vector multiplication algorithm coupled to a Lanczos and/or Rayleigh-Ritz algorithm that solves for eigenvalues. A prior upgrade of NEMO 3-D incorporated a capability for a strain treatment, parameterized for bulk material properties of GaAs and InAs, for two tight-binding submodels. NEMO 3-D has been demonstrated in atomistic analyses of effects of disorder in alloys and, in particular, in bulk In(x)Ga(1-x)As and in In(0.6)Ga(0.4)As quantum dots.

New algorithms for field-theoretic block copolymer simulations: Progress on using adaptive-mesh refinement and sparse matrix solvers in SCFT calculations

NASA Astrophysics Data System (ADS)

Sides, Scott; Jamroz, Ben; Crockett, Robert; Pletzer, Alexander

2012-02-01

Self-consistent field theory (SCFT) for dense polymer melts has been highly successful in describing complex morphologies in block copolymers. Field-theoretic simulations such as these are able to access large length and time scales that are difficult or impossible for particle-based simulations such as molecular dynamics. The modified diffusion equations that arise as a consequence of the coarse-graining procedure in the SCF theory can be efficiently solved with a pseudo-spectral (PS) method that uses fast-Fourier transforms on uniform Cartesian grids. However, PS methods can be difficult to apply in many block copolymer SCFT simulations (eg. confinement, interface adsorption) in which small spatial regions might require finer resolution than most of the simulation grid. Progress on using new solver algorithms to address these problems will be presented. The Tech-X Chompst project aims at marrying the best of adaptive mesh refinement with linear matrix solver algorithms. The Tech-X code PolySwift++ is an SCFT simulation platform that leverages ongoing development in coupling Chombo, a package for solving PDEs via block-structured AMR calculations and embedded boundaries, with PETSc, a toolkit that includes a large assortment of sparse linear solvers.

Dynamic optimization of open-loop input signals for ramp-up current profiles in tokamak plasmas

NASA Astrophysics Data System (ADS)

Ren, Zhigang; Xu, Chao; Lin, Qun; Loxton, Ryan; Teo, Kok Lay

2016-03-01

Establishing a good current spatial profile in tokamak fusion reactors is crucial to effective steady-state operation. The evolution of the current spatial profile is related to the evolution of the poloidal magnetic flux, which can be modeled in the normalized cylindrical coordinates using a parabolic partial differential equation (PDE) called the magnetic diffusion equation. In this paper, we consider the dynamic optimization problem of attaining the best possible current spatial profile during the ramp-up phase of the tokamak. We first use the Galerkin method to obtain a finite-dimensional ordinary differential equation (ODE) model based on the original magnetic diffusion PDE. Then, we combine the control parameterization method with a novel time-scaling transformation to obtain an approximate optimal parameter selection problem, which can be solved using gradient-based optimization techniques such as sequential quadratic programming (SQP). This control parameterization approach involves approximating the tokamak input signals by piecewise-linear functions whose slopes and break-points are decision variables to be optimized. We show that the gradient of the objective function with respect to the decision variables can be computed by solving an auxiliary dynamic system governing the state sensitivity matrix. Finally, we conclude the paper with simulation results for an example problem based on experimental data from the DIII-D tokamak in San Diego, California.

A finite element: Boundary integral method for electromagnetic scattering. Ph.D. Thesis Technical Report, Feb. - Sep. 1992

NASA Technical Reports Server (NTRS)

Collins, J. D.; Volakis, John L.

1992-01-01

A method that combines the finite element and boundary integral techniques for the numerical solution of electromagnetic scattering problems is presented. The finite element method is well known for requiring a low order storage and for its capability to model inhomogeneous structures. Of particular emphasis in this work is the reduction of the storage requirement by terminating the finite element mesh on a boundary in a fashion which renders the boundary integrals in convolutional form. The fast Fourier transform is then used to evaluate these integrals in a conjugate gradient solver, without a need to generate the actual matrix. This method has a marked advantage over traditional integral equation approaches with respect to the storage requirement of highly inhomogeneous structures. Rectangular, circular, and ogival mesh termination boundaries are examined for two-dimensional scattering. In the case of axially symmetric structures, the boundary integral matrix storage is reduced by exploiting matrix symmetries and solving the resulting system via the conjugate gradient method. In each case several results are presented for various scatterers aimed at validating the method and providing an assessment of its capabilities. Important in methods incorporating boundary integral equations is the issue of internal resonance. A method is implemented for their removal, and is shown to be effective in the two-dimensional and three-dimensional applications.

Efficient multitasking of Choleski matrix factorization on CRAY supercomputers

NASA Technical Reports Server (NTRS)

Overman, Andrea L.; Poole, Eugene L.

1991-01-01

A Choleski method is described and used to solve linear systems of equations that arise in large scale structural analysis. The method uses a novel variable-band storage scheme and is structured to exploit fast local memory caches while minimizing data access delays between main memory and vector registers. Several parallel implementations of this method are described for the CRAY-2 and CRAY Y-MP computers demonstrating the use of microtasking and autotasking directives. A portable parallel language, FORCE, is used for comparison with the microtasked and autotasked implementations. Results are presented comparing the matrix factorization times for three representative structural analysis problems from runs made in both dedicated and multi-user modes on both computers. CPU and wall clock timings are given for the parallel implementations and are compared to single processor timings of the same algorithm.

A computer package for the design and eigenproblem solution of damped linear multidegree of freedom systems

NASA Technical Reports Server (NTRS)

Ahmadian, M.; Inman, D. J.

1982-01-01

Systems described by the matrix differental equation are considered. An interactive design routine is presented for positive definite mass, damping, and stiffness matrices. Designing is accomplished by adjusting the mass, damping, and stiffness matrices to obtain a desired oscillation behavior. The algorithm also features interactively modifying the physical structure of the system, obtaining the matrix structure and a number of other system properties. In case of a general system, where the M, C, and K matrices lack any special properties, a routine for the eigenproblem solution of the system is developed. The latent roots are obtained by computing the characteristic polynomial of the system and solving for its roots. The above routines are prepared in FORTRAN IV and prove to be usable for the machines with low core memory.

Implicit method for the computation of unsteady flows on unstructured grids

NASA Technical Reports Server (NTRS)

Venkatakrishnan, V.; Mavriplis, D. J.

1995-01-01

An implicit method for the computation of unsteady flows on unstructured grids is presented. Following a finite difference approximation for the time derivative, the resulting nonlinear system of equations is solved at each time step by using an agglomeration multigrid procedure. The method allows for arbitrarily large time steps and is efficient in terms of computational effort and storage. Inviscid and viscous unsteady flows are computed to validate the procedure. The issue of the mass matrix which arises with vertex-centered finite volume schemes is addressed. The present formulation allows the mass matrix to be inverted indirectly. A mesh point movement and reconnection procedure is described that allows the grids to evolve with the motion of bodies. As an example of flow over bodies in relative motion, flow over a multi-element airfoil system undergoing deployment is computed.

Almost output regulation of LFT systems via gain-scheduling control

NASA Astrophysics Data System (ADS)

Yuan, Chengzhi; Duan, Chang; Wu, Fen

2018-05-01

Output regulation of general uncertain systems is a meaningful yet challenging problem. In spite of the rich literature in the field, the problem has not yet been addressed adequately due to the lack of an effective design mechanism. In this paper, we propose a new design framework for almost output regulation of uncertain systems described in the general form of linear fractional transformation (LFT) with time-varying parametric uncertainties and unknown external perturbations. A novel semi-LFT gain-scheduling output regulator structure is proposed, such that the associated control synthesis conditions guaranteeing both output regulation and ? disturbance attenuation performance are formulated as a set of linear matrix inequalities (LMIs) plus parameter-dependent linear matrix equations, which can be solved separately. A numerical example has been used to demonstrate the effectiveness of the proposed approach.

Evaluation of several non-reflecting computational boundary conditions for duct acoustics

NASA Technical Reports Server (NTRS)

Watson, Willie R.; Zorumski, William E.; Hodge, Steve L.

1994-01-01

Several non-reflecting computational boundary conditions that meet certain criteria and have potential applications to duct acoustics are evaluated for their effectiveness. The same interior solution scheme, grid, and order of approximation are used to evaluate each condition. Sparse matrix solution techniques are applied to solve the matrix equation resulting from the discretization. Modal series solutions for the sound attenuation in an infinite duct are used to evaluate the accuracy of each non-reflecting boundary conditions. The evaluations are performed for sound propagation in a softwall duct, for several sources, sound frequencies, and duct lengths. It is shown that a recently developed nonlocal boundary condition leads to sound attenuation predictions considerably more accurate for short ducts. This leads to a substantial reduction in the number of grid points when compared to other non-reflecting conditions.

Description of waves in inhomogeneous domains using Heun's equation

NASA Astrophysics Data System (ADS)

Bednarik, M.; Cervenka, M.

2018-04-01

There are a number of model equations describing electromagnetic, acoustic or quantum waves in inhomogeneous domains and some of them are of the same type from the mathematical point of view. This isomorphism enables us to use a unified approach to solving the corresponding equations. In this paper, the inhomogeneity is represented by a trigonometric spatial distribution of a parameter determining the properties of an inhomogeneous domain. From the point of view of modeling, this trigonometric parameter function can be smoothly connected to neighboring constant-parameter regions. For this type of distribution, exact local solutions of the model equations are represented by the local Heun functions. As the interval for which the solution is sought includes two regular singular points. For this reason, a method is proposed which resolves this problem only based on the local Heun functions. Further, the transfer matrix for the considered inhomogeneous domain is determined by means of the proposed method. As an example of the applicability of the presented solutions the transmission coefficient is calculated for the locally periodic structure which is given by an array of asymmetric barriers.

Resonant coherent excitation of hydrogen-like ions planar channeled in a crystal; Transition into the first excited state

NASA Astrophysics Data System (ADS)

Babaev, A.; Pivovarov, Yu. L.

2012-03-01

The presented program is designed to simulate the characteristics of resonant coherent excitation of hydrogen-like ions planar-channeled in a crystal. The program realizes the numerical algorithm to solve the Schrödinger equation for the ion-bound electron at a special resonance excitation condition. The calculated wave function of the bound electron defines probabilities for the ion to be in the either ground or first excited state, or to be ionized. Finally, in the outgoing beam the fractions of ions in the ground state, in the first excited state, and ionized by collisions with target electrons, are defined. The program code is written on C++ and is designed for multiprocessing systems (clusters). The output data are presented in the table. Program summaryProgram title: RCE_H-like_1 Catalogue identifier: AEKX_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEKX_v1_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.html No. of lines in distributed program, including test data, etc.: 2813 No. of bytes in distributed program, including test data, etc.: 34 667 Distribution format: tar.gz Programming language: C++ (g++, icc compilers) Computer: Multiprocessor systems (clusters) Operating system: Any OS based on LINUX; program was tested under Novell SLES 10 Has the code been vectorized or parallelized?: Yes. Contains MPI directives RAM: <1 MB per processor Classification: 2.1, 2.6, 7.10 External routines: MPI library for GNU C++, Intel C++ compilers Nature of problem: When relativistic hydrogen-like ion moves in the crystal in the planar channeling regime, in the ion rest frame the time-periodic electric field acts on the bound electron. If the frequency of this field matches the transition frequency between electronic energy levels, the resonant coherent excitation can take place. Therefore, ions in the different states may be observed in the outgoing beam behind the crystal. To get the probabilities for the ion to be in the ground state or in the first excited state, or to be ionized, the Schrödinger equation is solved for the electron of ion. The numerical solving of the Schrödinger equation is carried out taking into account the fine structure of electronic energy levels, the Stark effect due to the influence of the crystal electric field on electronic energy levels and the ionization of ion due to the collisions with crystal electrons. Solution method: The wave function of the electron of ion is the superposition of the wave functions of stationary states with time-dependent coefficients. These stationary wave functions and corresponding energies are defined from the stationary Schrödinger equation. The equation is reduced to the problem of the eigen values and vectors of Hermitian matrix. The corresponding matrix equation is considered as the linear equation system. Then the time-dependent coefficients of the electron wave function are defined from the Schrödinger equation, with a time-periodic crystal field. The time-periodic field is responsible for the transitions between the stationary states. The final time-dependent Schrödinger equation represents the matrix equation which has been solved by means of the QR-algorithm. Restrictions: As expected the program gives the correct results for relativistic hydrogen-like ions with the kinetic energies up to 1 GeV/u and at the crystal thicknesses of 1-100 μm. The restrictions are: first, the program might give inadequate results, when the ion kinetic energy is too large (>10 GeV/u); second, the unaccounted physical factors may be significant at specific conditions. For example, the spontaneous emission by exited highly charged ions, as well as both energy and angular spread of the incident beam, could lead to additional broadening of the resonance. The medium polarization by the electric field of ion can influence the electronic energy levels of the ion in the non-relativistic case. The role of these factors was discussed in the references. Also, the large crystal thickness may require large computational time. Running time: In general, the running time depends on the number of processors. In our tests we used the crystal thickness up to 100 μm and the number of 2.66 GHz processors was up to 100. The running time was about 1 hour in these conditions.

The Fokker-Planck equation for coupled Brown-Néel-rotation.

PubMed

Weizenecker, Jürgen

2018-01-22

Calculating the dynamic properties of magnetization of single-domain particles is of great importance for the tomographic imaging modality known as magnetic particle imaging (MPI). Although the assumption of instantaneous thermodynamic equilibrium (Langevin function) after application of time-dependent magnetic fields is sufficient for understanding the fundamental behavior, it is essential to consider the finite response times of magnetic particles for optimizing or analyzing various aspects, e.g. interpreting spectra, optimizing MPI sequences, developing new contrasts, and evaluating simplified models. The change in magnetization following the application of the fields is caused by two different movements: the geometric rotation of the particle and the rotation of magnetization with respect to the fixed particle axes. These individual rotations can be well described using the Langevin equations or the Fokker-Planck equation. However, because the two rotations generally exhibit interdependence, it is necessary to consider coupling between the two equations. This article shows how a coupled Fokker-Planck equation can be derived on the basis of coupled Langevin equations. Two physically equivalent Fokker-Planck equations are derived and transformed by means of an appropriate series expansion into a system of ordinary differential equations, which can be solved numerically. Finally, this system is also used to specify a system of differential equations for various limiting cases (Néel, Brown, uniaxial symmetry). Generally, the system exhibits a sparsely populated matrix and can therefore be handled well numerically.

The Fokker-Planck equation for coupled Brown-Néel-rotation

NASA Astrophysics Data System (ADS)

Weizenecker, Jürgen

2018-02-01

Calculating the dynamic properties of magnetization of single-domain particles is of great importance for the tomographic imaging modality known as magnetic particle imaging (MPI). Although the assumption of instantaneous thermodynamic equilibrium (Langevin function) after application of time-dependent magnetic fields is sufficient for understanding the fundamental behavior, it is essential to consider the finite response times of magnetic particles for optimizing or analyzing various aspects, e.g. interpreting spectra, optimizing MPI sequences, developing new contrasts, and evaluating simplified models. The change in magnetization following the application of the fields is caused by two different movements: the geometric rotation of the particle and the rotation of magnetization with respect to the fixed particle axes. These individual rotations can be well described using the Langevin equations or the Fokker-Planck equation. However, because the two rotations generally exhibit interdependence, it is necessary to consider coupling between the two equations. This article shows how a coupled Fokker-Planck equation can be derived on the basis of coupled Langevin equations. Two physically equivalent Fokker-Planck equations are derived and transformed by means of an appropriate series expansion into a system of ordinary differential equations, which can be solved numerically. Finally, this system is also used to specify a system of differential equations for various limiting cases (Néel, Brown, uniaxial symmetry). Generally, the system exhibits a sparsely populated matrix and can therefore be handled well numerically.

Transformation matrices between non-linear and linear differential equations

NASA Technical Reports Server (NTRS)

Sartain, R. L.

1983-01-01

In the linearization of systems of non-linear differential equations, those systems which can be exactly transformed into the second order linear differential equation Y"-AY'-BY=0 where Y, Y', and Y" are n x 1 vectors and A and B are constant n x n matrices of real numbers were considered. The 2n x 2n matrix was used to transform the above matrix equation into the first order matrix equation X' = MX. Specially the matrix M and the conditions which will diagonalize or triangularize M were studied. Transformation matrices P and P sub -1 were used to accomplish this diagonalization or triangularization to return to the solution of the second order matrix differential equation system from the first order system.

Differential geometry based solvation model I: Eulerian formulation

NASA Astrophysics Data System (ADS)

Chen, Zhan; Baker, Nathan A.; Wei, G. W.

2010-11-01

This paper presents a differential geometry based model for the analysis and computation of the equilibrium property of solvation. Differential geometry theory of surfaces is utilized to define and construct smooth interfaces with good stability and differentiability for use in characterizing the solvent-solute boundaries and in generating continuous dielectric functions across the computational domain. A total free energy functional is constructed to couple polar and nonpolar contributions to the solvation process. Geometric measure theory is employed to rigorously convert a Lagrangian formulation of the surface energy into an Eulerian formulation so as to bring all energy terms into an equal footing. By optimizing the total free energy functional, we derive coupled generalized Poisson-Boltzmann equation (GPBE) and generalized geometric flow equation (GGFE) for the electrostatic potential and the construction of realistic solvent-solute boundaries, respectively. By solving the coupled GPBE and GGFE, we obtain the electrostatic potential, the solvent-solute boundary profile, and the smooth dielectric function, and thereby improve the accuracy and stability of implicit solvation calculations. We also design efficient second-order numerical schemes for the solution of the GPBE and GGFE. Matrix resulted from the discretization of the GPBE is accelerated with appropriate preconditioners. An alternative direct implicit (ADI) scheme is designed to improve the stability of solving the GGFE. Two iterative approaches are designed to solve the coupled system of nonlinear partial differential equations. Extensive numerical experiments are designed to validate the present theoretical model, test computational methods, and optimize numerical algorithms. Example solvation analysis of both small compounds and proteins are carried out to further demonstrate the accuracy, stability, efficiency and robustness of the present new model and numerical approaches. Comparison is given to both experimental and theoretical results in the literature.