Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “solving”

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 217 records · Page 12

Neural Network-Based Variational Methods for Solving Quadratic Porous Medium Equations in High Dimensions

Here, in this paper, we propose and study neural network-based methods for solutions of high-dimensional quadratic porous medium equation (QPME). Three variational formulations of this nonlinear PDE are presented: a strong formulation and two weak formulations. For the strong formulation, the solution is directly parameterized with a neural network and optimized by minimizing the PDE residual. It can be proved that the convergence of the optimization problem guarantees the convergence of the approximate solution in the $L^1$ sense. The weak formulations are derived following (Brenier in Examples of hidden convexity in nonlinear PDEs, 2020) which characterizes the very weak solutions of QPME. Specifically speaking, the solutions are represented with intermediate functions who are parameterized with neural networks and are trained to optimize the weak formulations. Extensive numerical tests are further carried out to investigate the pros and cons of each formulation in low and high dimensions. This is an initial exploration made along the line of solving high-dimensional nonlinear PDEs with neural network-based methods, which we hope can provide some useful experience for future investigations.

97 MATHEMATICS AND COMPUTING↗

An efficient approach for solving Klein–Gordon equation arising in quantum field theory using wavelets

A new approach for the solution of Klein–Gordon equation using Legendre wavelet-based approximation method is presented. The properties of Legendre wavelets are used to reduce the problem to the solution of system of algebraic equations. Usually 2{sup (k−1)}M{sup 2} connection coefficients are required to solve the Klein–Gordon equation by Legendre wavelets method as mentioned in the literature. But, our proposed method based on Legendre wavelets and algebraic polynomials require only 2{sup (k−1)}M connection coefficients instead of 2{sup (k−1)}M{sup 2} . Also the convergence analysis and error estimation for the proposed function approximation through the truncated series have been discussed and approved with the exact solution. Illustrative examples are discussed to demonstrate the validity and applicability of the technique with lesser computational effort.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Solving numerically nonlinear systems of balance laws by multivariate sigmoidal functions approximation

A numerical method for solving systems of nonlinear one-dimensional balance laws, based on multivariate sigmoidal functions approximation, is developed. Constructive approximation theorems are first established in both, uniform and L{sup p} norms. A priori as well as a posteriori error estimates are derived for the numerical solutions, when various kinds of sigmoidal functions, such as unit step, logistic and Gompertz functions, are chosen. The residual of the numerical method is also estimated. Numerical examples are given to test the performance of the algorithm, a comparison with the Godunov method is made concerning accuracy and computational cost. Finally, the numerical stability of the method is analyzed.

97 MATHEMATICS AND COMPUTING↗

A fast eigenvalue approach for solving the trust region subproblem with an additional linear inequality

In this paper, we study the extended trust region subproblem (eTRS) in which the trust region intersects the Euclidean ball with a single linear inequality constraint. By reformulating the Lagrangian dual of eTRS as a two-parameter linear eigenvalue problem, we state a necessary and sufficient condition for its strong duality in terms of an optimal solution of a linearly constrained bivariate concave maximization problem. This results in an efficient algorithm for solving eTRS of large size whenever the strong duality is detected. Finally, some numerical experiments are given to show the effectiveness of the proposed method.

97 MATHEMATICS AND COMPUTING↗

An efficient algorithm for solving the generalized trust region subproblem

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

97 MATHEMATICS AND COMPUTING↗

Some new preconditioned generalized AOR methods for solving weighted linear least squares problems

In this paper, we propose some new preconditioned GAOR methods for solving weighted linear least squares problems and discuss their comparison results. Comparison results show that the convergence rates of the new preconditioned GAOR methods are better than those of the preconditioned GAOR methods presented by Shen et al. (Appl Math Mech Engl Ed 33(3):375–384, 2012) and Wang et al. (J Appl Math, doi: 10.1155/2012/563586 , 2012) whenever these methods are convergent. Finally, numerical experiments are provided to confirm the theoretical results obtained in this paper.

97 MATHEMATICS AND COMPUTING↗

Smoothing by cubic spline modified applied to solve inverse thermal problem

This paper presents an alternative to cubic spline regularization and its weighted form applied in solving inverse thermal problems. The inverse heat transfer problems are classified as ill-posed, that is, the solution may become unstable, mainly because they are sensitive to random errors deriving from the input data, necessitating a regularization method to soften these effects. The smoothing technique proposed by cubic spline regularization ensures that the global data tend to be more stable, with fewer data oscillations and dependent on a single arbitrary parameter input. It also shows that the weighted cubic spline is able to enhance filter action. The methods have been implemented in order for the search engine to optimize the choice of parameters and weight and, thus, the smoothing gains more flexibility and accuracy. The simulated and experimental tests confirm that the techniques are effective in reducing the amplified noise by inverse thermal problem presented.

97 MATHEMATICS AND COMPUTING↗

Runge–Kutta method for solving fuzzy differential equations under generalized differentiability

In this paper, we interpret a fuzzy differential equation by using the strongly generalized differentiability concept. Utilizing the Generalized Characterization Theorem, we investigate the problem of finding a numerical approximation of solutions. The Runge–Kutta approximation method is implemented and its error analysis, which guarantees pointwise convergence, is given. The method applicability is illustrated by solving a linear first-order fuzzy differential equation.

97 MATHEMATICS AND COMPUTING↗

Higher-order modification of Steffensen’s method for solving system of nonlinear equations

In this work, we propose a higher-order derivative free family for solving non-linear systems. The local order of convergence of the constructed family is first determined using first-order divided difference operators for functions of several variables and direct computation by Taylor’s series expansion. Computational efficiencies of the developed scheme is considered and compared with their closest competitors. Moreover, numerical experiments are performed on several large and complex non-linear systems. The results are found to be effective and comparable to other existing methods which also support the theoretical results.

97 MATHEMATICS AND COMPUTING↗

Cone-grid scheme for solving hyperbolic systems of conservation laws and one application

In this work, we introduce a new numerical method, the so-called cone-grid scheme for solving hyperbolic systems of conservation laws. The formulation and the theoretical analysis for this scheme are slightly simpler than other algorithms. Simultaneously, our technique leads to a more efficacious numerical scheme. The Riemann solution is the basic ingredient for this scheme. We also give the main application of this technique, namely the global weak solutions for the one-dimensional model prescribes heat conduction in solids at low temperature, which called phonon–Bose model. This system consists of a conservation equation for the energy density and the heat flux. The scheme also satisfies positivity. The cone-grid scheme was compared with exact solution by three numerical examples, where explicit solutions are known. These numerical results verify the accuracy of the proposed scheme qualitatively and quantitatively.

97 MATHEMATICS AND COMPUTING↗

On spectral methods for solving variable-order fractional integro-differential equations

This paper applies the shifted Jacobi–Gauss collocation (SJ–G-C) method for solving variable-order fractional integro-differential equations (VO-FIDE) with initial conditions. The Riemann–Liouville fractional derivative, D{sup ν(x)}, and integral, I{sup ν(x)}, of variable order are combined, and the SJ–G-C applied to produce a system of algebraic equations. Numerical experiments demonstrate the applicability and reliability of the algorithm when compared with current methods.

97 MATHEMATICS AND COMPUTING↗

Mass-preserving time second-order explicit–implicit domain decomposition schemes for solving parabolic equations with variable coefficients

In this paper, the new mass-preserving time second-order explicit–implicit domain decomposition (DD) schemes for solving parabolic equations with various coefficients are proposed. In the schemes, first, the interface values on the interfaces of sub-domains are explicitly calculated, in which two kinds of explicit difference schemes are used. Second, the interior values in sub-domains are determined by the implicit schemes. Third, the interface values are recalculated explicitly to preserve mass. The important feature is that the developed schemes are more than first order in time step and the correction operators at the third step ensure the schemes’ mass conservative. The stability and convergence are analyzed for the two schemes. The optimal error estimates are obtained in the H{sup 1} semi-norm under a stability condition. Numerical experiments confirm the theoretical results.

97 MATHEMATICS AND COMPUTING↗

A multigrid waveform relaxation method for solving the poroelasticity equations

In this work, a multigrid waveform relaxation method is proposed for solving a collocated finite difference discretization of the linear Biot’s model. This gives rise to the first space–time multigrid solver for poroelasticity equations in the literature. The waveform relaxation iteration is based on a point-wise Vanka smoother that couples the pressure variable at a grid-point with the displacements around it. A semi-algebraic mode analysis is proposed to theoretically analyze the convergence of the multigrid waveform relaxation algorithm. This analysis is novel since it combines the semi-algebraic analysis, suitable for parabolic problems, with the non-standard analysis for overlapping smoothers. The practical utility of the method is illustrated through several numerical experiments in one and two dimensions.

97 MATHEMATICS AND COMPUTING↗

On the numerical algorithms of parametrization method for solving a two-point boundary-value problem for impulsive systems of loaded differential equations

A linear two-point boundary value problem for a system of loaded differential equations with impulse effect is investigated. Values in the previous impulse points are taken into consideration in the conditions of impulse effect. The considered problem is reduced to an equivalent multi-point boundary value problem for the system of ordinary differential equations with parameters. A numerical implementation of parametrization method is offered using the Runge–Kutta method of 4th-order accuracy for solving the Cauchy problems for ordinary differential equations. The constructed numerical algorithms are illustrated by examples.

97 MATHEMATICS AND COMPUTING↗

A Müntz wavelets collocation method for solving fractional differential equations

In this paper, we introduce a new set of wavelets, namely Müntz wavelets. These wavelets are defined based on Müntz Legendre polynomials which have the property of orthogonality. We stabilize the wavelet coefficients by utilizing Jacobi polynomials to construct the modified Müntz wavelets. Next, we present a collocation scheme based on Müntz wavelets for solving fractional differential equations. The fractional derivative is described in the Caputo sense. Some error estimates are given and numerical examples are included to demonstrate the applicability and accuracy of the proposed method. This includes the elastic-dissipative mathematical model of linear mechanical devices known as Boltzman operator.

97 MATHEMATICS AND COMPUTING↗

Numerical multi-scaling method to solve the linear stochastic partial differential equations

In this paper, we propose a multi-scaling method to solve a class of the stochastic partial differential equations (SPDEs) of Itô-type. By this method, we approximate the solution of the SPDEs with strongly elliptic operator on a finite domain. The method is based on B-spline wavelet approximations; some of these functions are reshaped to satisfy on boundary conditions exactly. We prove the consistency and stability of the method. Illustrative examples are included to demonstrate the validity and applicability of our proposed technique.

97 MATHEMATICS AND COMPUTING↗

GW-PINN: A deep learning algorithm for solving groundwater flow equations

Machine learning methods provide new perspective for more convenient and efficient prediction of groundwater flow. In this study, a deep learning method “GW-PINN” without labeled data for solving groundwater flow equations with wells was proposed. GW-PINN takes the physics inform neural network (PINN) as the backbone and uses either the hard or soft constraint in the loss function for training. A locally refined sampling strategy (LRS) is adopted to generate the consistent spatial sampling points for problems with strong hydraulic head change, and then combined with an appropriate temporal sampling scheme to obtain the final spatial-temporal sampling points. A snowball-style two-stage training strategy by dividing the temporal domain into two subdomains is designed to decrease the sampling points. Five cases were designed to test the training performance of GW-PINN under different sampling strategies and two constraints. The predicted results of GW-PINN were compared with MODFLOW and the analytical solution. The results demonstrate that GW-PINN possesses strong ability in capturing the hydraulic head change for both confined and un-confined aquifers. The hard constraint owns more robust learning ability than the soft constraint. The LRS strategy can generate more accurate results with much fewer sampling points than traditional sampling strategies, and the snowball-style two-stage training strategy is significantly efficient for problems with the drastic change of hydraulic head. Additionally, the application of GW-PINN as a surrogate model for parameterized groundwater flow equations is illustrated. This study provides an option tool for efficient groundwater flow simulation, especially for those with local refinements are needed.

54 ENVIRONMENTAL SCIENCES↗