Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “convergence behaviors”

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

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

At least 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

A Polar Scaling Technique for the Regularization of Strongly Singular and Strongly Near-Singular Helmholtz Surface Integrals Evaluated Over 2-D Domains

The numerical integration of expressions containing strong singularities or strong near-singularities has long been a challenging problem in the electromagnetics community. Much attention has been paid to this problem, as strong $1/R^{{2}}$ singularities routinely appear when implementing electromagnetic simulation techniques like the method of moments (MoM). To date, several techniques, from singularity extraction to singularity cancellation (SC), have been employed to deal with problems that require the evaluation of 2-D strongly singular integrals. However, no single technique has been proposed that can deal with both strong singularities and strong near-singularities in a fully numerical manner for arbitrary 2-D domains. Moreover, it has been claimed that the Helmholtz-type strongly singular integral found in the MoM is convergent in a principal value sense, but this convergence value has yet to be proven mathematically. In this work, we will conduct the convergence proof and introduce a “polar scaling” change of variables method that may be used to evaluate Helmholtz integrals with both strong and weak singularities/near-singularities. The technique is fully numerical and can in principle be applied to any planar or curved polygon and any nonsingular basis function. We will also provide numerical results showing useful convergence behavior for integrals involving both exact and near-singularities.

47 OTHER INSTRUMENTATION↗
DOE OSTI2020

Block Krylov Subspace Methods for Functions of Matrices II: Modified Block FOM

We analyze an expansion of the generalized block Krylov subspace framework of [Electron. Trans. Numer. Anal., 47 (2017), pp. 100--126]. This expansion allows the use of low-rank modifications of the matrix projected onto the block Krylov subspace and contains, as special cases, the block GMRES method and the new block Radau--Arnoldi method. Within this general setting, we present results that extend the interpolation property from the nonblock case to a matrix polynomial interpolation property for the block case, and we relate the eigenvalues of the projected matrix to the latent roots of these matrix polynomials. Some error bounds for these modified block FOM methods for solving linear systems are presented. We then show how cospatial residuals can be preserved in the case of families of shifted linear block systems. This result is used to derive computationally practical restarted algorithms for block Krylov approximations that compute the action of a matrix function on a set of several vectors simultaneously. Finally, we prove some error bounds and present numerical results showing that two modifications of FOM, the block harmonic and the block Radau--Arnoldi methods for matrix functions, can significantly improve the convergence behavior.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

On High-Order/Low-Order and Micro-Macro Methods for Implicit Time-Stepping of the BGK Model

In this paper, a high-order/low-order (HOLO) method is combined with a micro-macro (MM) decomposition to accelerate iterative solvers in fully implicit time-stepping of the Bhatnagar–Gross–Krook (BGK) equation for gas dynamics. The MM formulation represents a kinetic distribution as the sum of a local Maxwellian and a perturbation. In highly collisional regimes, the perturbation away from initial and boundary layers is small and can be compressed to reduce the overall storage cost of the distribution. The convergence behavior of the MM methods, the usual HOLO method, and the standard source iteration method is analyzed on a linear BGK model. Both the HOLO and MM methods are implemented using a discontinuous Galerkin (DG) discretization in phase space, which naturally preserves the consistency between high- and low-order models required by the HOLO approach. Furthermore, the accuracy and performance of these methods are compared on the Sod shock tube problem and a sudden wall heating boundary layer problem. Overall, the results demonstrate the robustness of the MM and HOLO approaches and illustrate the compression benefits enabled by the MM formulation when the kinetic distribution is near equilibrium.

BGK model↗
DOE OSTI2020

Numerical Experiments and Identification of Areas for Further Consideration (B639388 Subcontract Quarter II Report)

The second quarter of the project was spent carrying out numerical experiments on a variety of test matrices, using a combination of precisions, with the intent to study the numerical properties (namely, accuracy and convergence behavior) of the Conjugate Gradient (CG) method. We summarize our findings in the remainder of the document. Other activities include attending biweekly xSDK meetings. We are also currently collaborating with Steven Thomas (NREL) on the numerical stability analysis of “low-synch” Gram-Schmidt routines, for potential application within high-performance GMRES variants. This work is in progress. The subsequent quarter will be spent delving into the numerical analysis in order to provide theoretical explanation for the behavior observed in our experiments.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Parameter Sensitivity Analysis of the SparTen High Performance Sparse Tensor Decomposition Software (Extended Analysis)

Tensor decomposition models play an increasingly important role in modern data science applications. One problem of particular interest is fitting a low-rank Canonical Polyadic (CP) tensor decomposition model when the tensor has sparse structure and the tensor elements are nonnegative count data. SparTen is a high-performance C++ library which computes a low-rank decomposition using different solvers: a first-order quasi-Newton or a second-order damped Newton method, along with the appropriate choice of runtime parameters. Since default parameters in SparTen are tuned to experimental results in prior published work on a single real-world dataset conducted using MATLAB implementations of these methods, it remains unclear if the parameter defaults in SparTen are appropriate for general tensor data. Furthermore, it is unknown how sensitive algorithm convergence is to changes in the input parameter values. This report addresses these unresolved issues with large-scale experimentation on three benchmark tensor data sets. Experiments were conducted on several different CPU architectures and replicated with many initial states to establish generalized profiles of algorithm convergence behavior.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Improved Weld Residual Stress Modeling System in BlackBear

This report presents enhancements to the MOOSE-based BlackBear application aimed at improving its capability to simulate welding and other thermo-mechanical manufacturing processes. Two primary avenues of improvement are pursued. First, to enhance user accessibility, we introduce a centralized default block restriction mechanism that ensures coverage checks are performed within user-specified default blocks. This default setting is applied consistently to all block-describable objects, such as variables, kernels, and more. In addition, we develop a modular action for moving heat source simulations, which integrates path file parsing, subdomain modification, and heat source kernel enforcement into a single, streamlined configuration. Second, to improve solver robustness, we implement an alternative method for assigning initial conditions to the updated active domain during the simulation, thereby enhancing convergence behavior. To validate the framework, we design and conduct several benchmark simulations, including heat conduction with progressive material addition, linear elasticity with time-dependent material deposition, and viscoplasticity model with isotropic hardening under similar conditions. Finally, we demonstrate the effectiveness of the proposed framework through large-scale thermo-mechanical welding simulations in both two and three dimensions.

42 ENGINEERING↗
NASA NTRS1972

Vlasov equation eigenvalues and eigenvectors for Fourier-Hermite dispersion matrices of order greater than 1,000

The connection between the Van Kampen and Landau representations of the Vlasov equations has been extended to Fourier-Hermite expansions containing more than 1000 terms by taking advantage of the properties of tridiagonal matrices. These numerical results are regarded as conclusive indications of the nonuniformly convergent behavior of the approximation curve in the limit of an infinite number of terms and represent an extension of work begun by Grant (1967) and by Grant and Feix (1967).

Grant, F. C.↗
NASA NTRS1972

A review of nonstatistical techniques for the estimation of vertical atmospheric structure from remote infrared measurements

Mathematical techniques used in atmospheric profile inversion are reviewed, with the discussion limited to methods that do not require extensive information on the statistical properties of the profiles. The basic problem of the calculation of vertical profiles from noise contaminated infrared spectral measurements is examined. Three specific examples of methods of solution are given: the iterative minimum estimation method, a second linear iterative method, and the algorithm of Chahine. Satellite data are used in an empirical comparison of the methods. Several factors are considered, including the stability of solutions, convergence behavior of the iterative methods, and dependence of the solutions on the first guess, a factor that is particularly important in the treatment of data from other planets.

Conrath, B. J.↗
NASA NTRS1981

A Galerkin type finite element method for rotary-wing aeroelasticity in hover and forward flight

A Galerkin finite element method for the spatial discretization of the nonlinear, nonselfadjoint, partial differential equations governing rotary-wing aeroelasticity is presented. This method reduces algebraic manipulative labor significantly when compared to the global Galerkin method based on assumed modes. Furthermore, the Galerkin finite element method is ideally suited to treat rotor blades with discontinuous mass and stiffness distribution and structurally redundant configurations as they appear in bearingless rotors. Implementation of the method is illustrated for the coupled flap-lag aeroelastic problem of hingeless rotor blades in hover and forward flight. Numerical results for stability and response illustrate the numerical properties and convergence behavior of the method. It is concluded that the Galerkin finite element method is a practical tool for solving rotary-wing aeroelastic stability and response problems.

Straub, F. K.↗
NASA NTRS1982

Rotorcraft Blade Mode Damping Identification from Random Responses Using a Recursive Maximum Likelihood Algorithm

An on line technique is presented for the identification of rotor blade modal damping and frequency from rotorcraft random response test data. The identification technique is based upon a recursive maximum likelihood (RML) algorithm, which is demonstrated to have excellent convergence characteristics in the presence of random measurement noise and random excitation. The RML technique requires virtually no user interaction, provides accurate confidence bands on the parameter estimates, and can be used for continuous monitoring of modal damping during wind tunnel or flight testing. Results are presented from simulation random response data which quantify the identified parameter convergence behavior for various levels of random excitation. The data length required for acceptable parameter accuracy is shown to depend upon the amplitude of random response and the modal damping level. Random response amplitudes of 1.25 degrees to .05 degrees are investigated. The RML technique is applied to hingeless rotor test data. The inplane lag regressing mode is identified at different rotor speeds. The identification from the test data is compared with the simulation results and with other available estimates of frequency and damping.

Molusis, J. A.↗
NASA NTRS1982

On-line methods for rotorcraft aeroelastic mode identification

The requirements for the on-line identification of rotorcraft aeroelastic blade modes from random response test data are presented. A recursive maximum likelihood (RML) technique is used in conjunction with a bandpass filter to identify isolated blade mode damping and frequency. The RML technique is demonstrated to have excellent convergence characteristics in random measurement noise and random process noise excitation. The RML identification technique uses an ARMA representation for the aeroelastic stochastic system and requires virtually no user interaction while providing accurate confidence bands on the parameter estimates. Comparisons are made with an off-line Newton type maximum likelihood algorithm which uses a state variable model representation. Results are presented from simulation random response data which quantify the identifed parameter convergence behavior for various levels of random excitation which is typical of wind tunnel turbulence levels. The RML technique is applied to hingless rotor test data from the NASA Langley Research Center Helicopter Hover Facility.

Molusis, J. A.↗
NASA NTRS1986

Analysis of the SOR iteration for the 9-point Laplacian

The SOR iteration for solving linear systems of equations depends upon an overrelaxation factor omega. A theory for determining omega was given by Young (1950) for consistently ordered matrices. Here the optimal omega is determined for the 9-point stencil for the model problem of Laplace's equation on a square. Several orderings of the equations are considered, including the natural rowwise and multicolor orderings, all of which lead to non-consistently ordered matrices, and two equivalence classes of orderings are found with different convergence behavior and optimal omega's. The results for the natural rowwise ordering are compared to those of Garabedian (1956) and it is explained why both results are, in a sense, correct, even though they differ. Also analyzed is a pseudo SOR method for the model problem and it is shown that it is not as effective as the SOR methods. Finally, the point SOR methods are compared to known results for line SOR methods for this problem.

Loyce M. Adams↗
NASA NTRS1989

Jacobi-Bessel Analysis Of Antennas With Elliptical Apertures.

Coordinate transformation improves convergence pattern analysis of elliptical-aperture antennas. Modified version of Jacobi-Bessel expansion for vector diffraction analysis of reflector antennas uses coordinate transformation to improve convergence with elliptical apertures. Expansion converges rapidly for antennas with circular apertures, but less rapidly for elliptical apertures. Difference in convergence behavior between circular and elliptical Jacobi-Bessel algorithms indicated by highest values of indices m, n, and p required to achieve same accuracy in computed radiation pattern of offset paraboloidal antenna with elliptical aperture.

Rahmat-Samii, Y.↗
NASA NTRS1990

Semigroup theory and numerical approximation for equations in linear viscoelasticity

A class of abstract integrodifferential equations used to model linear viscoelastic beams is investigated analytically, applying a Hilbert-space approach. The basic equation is rewritten as a Cauchy problem, and its well-posedness is demonstrated. Finite-dimensional subspaces of the state space and an estimate of the state operator are obtained; approximation schemes for the equations are constructed; and the convergence is proved using the Trotter-Kato theorem of linear semigroup theory. The actual convergence behavior of different approximations is demonstrated in numerical computations, and the results are presented in tables.

Fabiano, R. H.↗
NASA NTRS1990

Collision strengths for dipole-allowed transitions in S II

Calculations of collision strengths for electron-impact excitations of S II from the ground state 3p3 4S0 to excited states 3p4 4P, 3d 4F, 3d 4D, 4s 4P, and 3d 4P were carried out using the R-matrix code described by Berrington et al. (1978) and the NIEM code described by Henry et al. (1981). Results are presented for the thermally averaged collision strengths for the five-state and six-state calculations. Convergence behaviors were examined by comparison with the six-state calculations and the previously obtained two-state calculations. Uncertainties for these transitions were estimated to be within 20 percent, except for the 4S0 - 3p4 4P transition in which a 40 percent uncertainty was estimated.

Ho, Y. K.↗
NASA NTRS1989

Multilevel filtering elliptic preconditioners

A class of preconditioners is presented for elliptic problems built on ideas borrowed from the digital filtering theory and implemented on a multilevel grid structure. They are designed to be both rapidly convergent and highly parallelizable. The digital filtering viewpoint allows the use of filter design techniques for constructing elliptic preconditioners and also provides an alternative framework for understanding several other recently proposed multilevel preconditioners. Numerical results are presented to assess the convergence behavior of the new methods and to compare them with other preconditioners of multilevel type, including the usual multigrid method as preconditioner, the hierarchical basis method and a recent method proposed by Bramble-Pasciak-Xu.

Kuo, C. C. Jay↗
NASA NTRS1990

Electronic neural networks for global optimization

An electronic neural network with feedback architecture, implemented in analog custom VLSI is described. Its application to problems of global optimization for dynamic assignment is discussed. The convergence properties of the neural network hardware are compared with computer simulation results. The neural network's ability to provide optimal or near optimal solutions within only a few neuron time constants, a speed enhancement of several orders of magnitude over conventional search methods, is demonstrated. The effect of noise on the circuit dynamics and the convergence behavior of the neural network hardware is also examined.

Thakoor, A. P.↗