Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “collocation”

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 181 records · Page 10

Absorbing boundary condition (ABC) and perfectly matched layer (PML) in numerical beam propagation: a comparison

The absorbing boundary condition (ABC) and the perfectly matched layer (PML) are employed to suppress the numerical reflections in wave propagation methods. The PML has earlier been shown to fail at the grazing angle propagation of beam. The ABC is preferred over the PML where refractive index is not an analytic function. We have explored the performance of the ABC in reflection-less absorption of non-paraxial propagation of beams and have compared it against the PML. We have considered an example of the propagation of Gaussian beams through a homogeneous medium terminated with ABC or PML. We have used the collocation method for propagation. We have found that both the boundary conditions are comparable in performance. The ABC performed relatively better than the PML for beams at smaller angles. However, the performance of the PML is better than that of the ABC at larger tilt angles.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A state estimation approach based on stochastic expansions

This paper presents a new approach for state estimation problems. It is based on the representation of random variables using stochastic functions. Its main idea is to expand the state variables in terms of the noise variables of the system, and then estimate the unnoisy value of the state variables by taking the mean value of the stochastic expansion. Moreover, it was shown that in some situations, the proposed approach may be adapted to the determination of the probability distribution of the state noise. For the determination of the coefficients of the expansions, we present three approaches: moment matching (MM), collocation (COL) and variational (VAR). In the numerical analysis section, three examples are analyzed including a discrete linear system, the Influenza in a boarding school and the state estimation problem in the Hodgkin–Huxley’s model. In all these examples, the proposed approach was able to estimate the values of the state variables with precision, i.e., with very low RMS values.

97 MATHEMATICS AND COMPUTING↗

A computationally efficient method for tempered fractional differential equations with application

This paper investigates the numerical approximation of the tempered fractional integral by using the Sinc-collocation scheme. The algorithm is extended to solve a class of tempered fractional differential equations that converges to the solution with exponential rate. Several numerical examples compare the numerical approximations with the exact solutions. The behavioral responses of the lumped capacitance model with tempered fractional order for transient conduction are investigated. The efficiency and accuracy of the proposed scheme are analyzed in the perspective of the L{sub 2}-norm error and convergence order.

97 MATHEMATICS AND COMPUTING↗

Numerical approach based on fractional-order Lagrange polynomials for solving a class of fractional differential equations

In this study, we propose a new set of fractional functions based on the Lagrange polynomials to solve a class of fractional differential equations. Fractional differential equations are the best tools for modelling natural phenomenon that are elaborated by fractional calculus. Therefore, we need an accurate and efficient technique for solving them. The main purpose of this article is to generalize new functions based on Lagrange polynomials to the fractional calculus. At first, we present a new representation of Lagrange polynomials and in continue, we propose a new set of fractional-order functions which are called fractional-order Lagrange polynomials (FLPs). Besides, a general formulation for operational matrices of fractional integration and derivative of FLPs on arbitrary nodal points are extracted. These matrices are obtained using Laplace transform. The initial value problems is reduced to the system of algebraic equations using the operational matrix of fractional integration and collocation method. Also, we find the upper bound of error vector for the fractional integration operational matrix and we indicate convergence of approximations of FLPs. Illustrative examples are included to demonstrate the validity and applicability of the proposed technique.

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↗

A semi-discrete scheme for solving fourth-order partial integro-differential equation with a weakly singular kernel using Legendre wavelets method

In this paper, a semi-discrete scheme is presented for solving fourth-order partial integro-differential equations with a weakly singular kernel. The second-order backward difference formula is used to discretize the temporal derivatives. After discretizing the temporal derivatives, the considered problems are converted into a set of ordinary differential equations which are solved by using Legendre wavelets collocation method. The stability and convergence properties related to the time discretization are discussed and theoretically proven. Several numerical examples are included to demonstrate the accuracy and efficiency of the proposed method.

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↗

Discrete Hahn polynomials for numerical solution of two-dimensional variable-order fractional Rayleigh–Stokes problem

The main aim of this paper is to find the numerical solutions of 2D Rayleigh–Stokes problem with the variable-order fractional derivatives in the Riemann–Liouville sense. The presented method is based on collocation procedure in combination with the new operational matrix of the variable-order fractional derivatives, in the Caputo sense, for the discrete Hahn polynomials. The main advantage of the proposed method is obtaining a global approximation for spatial and temporal discretizations, and it reduced the problem to an algebraic system, which is easier to solve. Also, the profit of approximating a continuous function by Hahn polynomials is that for computing the coefficients of the expansion, we only have to compute a summation and the calculation of coefficients is exact. The error bound for the approximate solution is estimated. Finally, we evaluate results of the presented method with other numerical methods.

97 MATHEMATICS AND COMPUTING↗

Compatible meshfree discretization of surface PDEs

Meshfree discretization of surface partial differential equations is appealing, due to their ability to naturally adapt to deforming motion of the underlying manifold. In this work, we consider an existing scheme proposed by Liang et al. reinterpreted in the context of generalized moving least squares (GMLS), showing that existing numerical analysis from the GMLS literature applies to their scheme. With this interpretation, their approach may then be unified with recent work developing compatible meshfree discretizations for the div-grad problem in R d . Informally, this is analogous to an extension of collocated finite differences to staggered finite difference methods, but in the manifold setting and with unstructured nodal data. In this way, we obtain a compatible meshfree discretization of elliptic problems on manifolds which is naturally stable for problems with material interfaces, without the need to introduce numerical dissipation or local enrichment near the interface. As a result, we provide convergence studies illustrating the high-order convergence and stability of the approach for manufactured solutions and for an adaptation of the classical five-strip benchmark to a cylindrical manifold.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Experimental and Numerical Investigation on Vibration of Sandwich Plates with Honeycomb Cores Based on Radial Basis Function

The vibration characteristic of the sandwich plate with a honeycomb core was investigated by experimental measurements and numerical calculation based on radial basis function (RBF). RBF method was used not only in the meshless approach but also in the post-processing of the experimental data. During the experiment, amplitude-fluctuation electronic speckle pattern interferometry was applied to access the resonant frequencies and the corresponding vibration mode shapes simultaneously. Then RBF method was used to improve the quality of patterns and reconstruct the out-of-plane vibration amplitude after fringe analysis. As for numerical calculation, the modal parameters were numerically predicted using the first-order shear deformation theory. The computation approach was based on collocation with multi-quadric radial basis function. To understand the influence of the thickness of face sheet on dynamic behaviors, three types of specimens with different thickness were tested and analyzed. Of particular interest was that the vibration modes show veering due to the thickness increment. Furthermore, the numerical predicted results were compared with the experimental measurements for the first five modes. They are in good agreement with each other for resonant frequencies, mode shapes and relative out-of-plane amplitudes.

36 MATERIALS SCIENCE↗

Generalized Modular Representation Framework for the Synthesis of Extractive Separation Systems

In this work, a systematic process synthesis and intensification method is presented for extractive separation based on the Generalized Modular Representation Framework (GMF). GMF employs a mass/heat exchange module-based superstructure representation, incorporating detailed thermodynamic model, to investigate conventional or intensified process options for nonideal azeotropic separation without a pre-postulation of plausible unit/flowsheet configurations. Orthogonal Collocation is also applied to enhance GMF representation to obtain intra-module operation information and module dimensionality estimation while maintaining model size compactness. Furthermore, entrainer selection, process synthesis, design, and intensification are examined within a single mixed-integer nonlinear optimization (MINLP) problem. A case study on the separation of ethanol-water mixture is presented to highlight the potential of the proposed approach in deriving optimal and verifiable extractive separation systems.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Domain wall motion across microstructural features in polycrystalline ferroelectric films

This paper describes the effect of microstructural features such as grain boundaries and triple points on the pinning of domain wall motion in perovskite Pb(Zr 0.52 Ti 0.48 )O 3 (PZT) films on polycrystalline SrRuO 3 /SrTiO 3 substrates. Here, spatial variability in the collective domain wall dynamics was assessed using non-linearity mapping via Band Excitation Piezoresponse Force Microscopy (BE-PFM). Collocating the non-linearity maps with triple point locations (as visualized by EBSD) allowed for exploration of the effects that local microstructure (e.g., grain boundary) have on domain wall motion. It was found that the extrinsic behavior varied with both the misorientation angle and the proximity to the grain boundary. The width of influence of individual grain boundaries on the motion of domain walls was a function of the character of the grain boundary; random grain boundaries exhibit deeper minima in α d /d 33,initial and larger widths of influence (up to 905 nm) compared to coincident site lattice (CSL) boundaries (up to 572 nm). Additionally, triple points containing larger numbers of random boundaries exhibited non-Rayleigh behavior to greater distances, suggesting that the triple point provides either a deep potential minimum or a region where domain wall motion is unfavorable.

36 MATERIALS SCIENCE↗

An experimental comparison of a space-time multigrid method with PFASST for a reaction-diffusion problem

We consider two parallel-in-time approaches applied to a (reaction) diffusion problem, possibly non-linear. In particular, we consider PFASST (Parallel Full Approximation Scheme in Space and Time) and space-time multigrid strategies. For both approaches, we start from an integral formulation of the continuous time dependent problem. Then, a collocation form for PFASST and a discontinuous Galerkin discretization in time for the space-time multi-grid are employed, resulting in the same discrete solution at the time nodes. Strong and weak scaling of both multilevel strategies are compared for varying orders of the temporal discretization. Moreover, we investigate the respective convergence behavior for non-linear problems and highlight quantitative differences in execution times

97 MATHEMATICS AND COMPUTING↗

A hybrid meshfree discretization to improve the numerical performance of peridynamic models

Efficient and accurate calculation of spatial integrals is of major interest in the numerical implementation of peridynamics (PD). The standard way to perform this calculation is a particle-based approach that discretizes the strong form of the PD governing equation. This approach has rapidly been adopted by the PD community since it offers some advantages. Additionally, it is computationally cheaper than other available schemes, can conveniently handle material separation, and effectively deals with nonlinear PD models. Nevertheless, PD models are still computationally very expensive compared with those based on the classical continuum mechanics theory, particularly for large-scale problems in three dimensions. This results from the nonlocal nature of the PD theory which leads to interactions of each node of a discretized body with multiple surrounding nodes. Here, we propose a new approach to significantly boost the numerical efficiency of PD models. We propose a discretization scheme that employs a simple collocation procedure and is truly meshfree; i.e., it does not depend on any background integration cells. In contrast to the standard scheme, the proposed scheme requires a much smaller set of neighboring nodes (keeping the same physical length scale) to achieve a specific accuracy and is thus computationally more efficient. Our new scheme is applicable to the case of linear PD models and within neighborhoods where the solution can be approximated by smooth basis functions. Therefore, to fully exploit the advantages of both the standard and the proposed schemes, a hybrid discretization is presented that combines both approaches within an adaptive framework. The high performance of the developed framework is illustrated by several numerical examples, including brittle fracture and corrosion problems in two and three dimensions.

42 ENGINEERING↗

Peridynamic elastic waves in two-dimensional unbounded domains: Construction of nonlocal Dirichlet-type absorbing boundary conditions

The focus of this paper is on application of peridynamics (PD) to propagation of elastic waves in unbounded domains. We construct absorbing boundary conditions (ABCs) derived from a semi-analytical solution of the PD governing equation at the exterior region. This solution is made up of a finite series of plane waves, as fundamental solutions (modes), which satisfy the PD dispersion relations. The modes are adjusted to transmit the energy from the interior region (near field) to the exterior region (far field). The corresponding unknown coefficients of the series are found in terms of the displacement field at a layer of points adjacent to the absorbing boundary. This is accomplished through a collocation procedure at subregions (clouds) around each absorbing point. The proposed ABCs offer appealing advantages, which facilitate their application to PD. They are of Dirichlet-type, hence their implementation is relatively simple as no derivatives of the field variables are required. They are constructed in the time and space domains and thus application of Fourier and Laplace transforms, cumbersome for nonlocal models, is not required. At the discrete level, the modes satisfy the same numerical dispersion relations of the near field, which makes the far-field solution compatible with that of the near field. We scrutinize the performance of the proposed ABCs through several examples. So our investigation shows that the proposed ABCs perform stably in time with an appropriate level of accuracy even in problems characterized by highly-dispersive propagating waves, including crack propagation in semi-unbounded brittle solids.

42 ENGINEERING↗

An end-to-end deep learning method for solving nonlocal Allen–Cahn and Cahn–Hilliard phase-field models

Here, we propose an efficient end-to-end deep learning method for solving nonlocal Allen–Cahn (AC) and Cahn–Hilliard (CH) phase-field models. One motivation for this effort emanates from the fact that discretized partial differential equation-based AC or CH phase-field models result in diffuse interfaces between phases, with the only recourse for remediation is to severely refine the spatial grids in the vicinity of the true moving sharp interface whose width is determined by a grid-independent parameter that is substantially larger than the local grid size. In this work, we introduce non-mass conserving nonlocal AC or CH phase-field models with regular, logarithmic, or obstacle double-well potentials. Because of non-locality, some of these models feature totally sharp interfaces separating phases. The discretization of such models can lead to a transition between phases whose width is only a single grid cell wide. Another motivation is to use deep learning approaches to ameliorate the otherwise high cost of solving discretized nonlocal phase-field models. To this end, loss functions of the customized neural networks are defined using the residual of the fully discrete approximations of the AC or CH models, which results from applying a Fourier collocation method and a temporal semi-implicit approximation. To address the long-range interactions in the models, we tailor the architecture of the neural network by incorporating a nonlocal kernel as an input channel to the neural network model. We then provide the results of extensive computational experiments to illustrate the accuracy, predictive capabilities, and cost reductions of the proposed method.

42 ENGINEERING↗

Physics-informed latent neural operator for real-time predictions of time-dependent parametric PDEs

Deep operator network (DeepONet) has shown significant promise as surrogate models for systems governed by partial differential equations (PDEs), enabling accurate mappings between infinite-dimensional function spaces. However, when applied to systems with high-dimensional input-output mappings arising from large numbers of spatial and temporal collocation points, these models often require heavily overparameterized networks, leading to long training times. Latent DeepONet addresses some of these challenges by introducing a two-step approach: first learning a reduced latent space using a separate model, followed by operator learning within this latent space. While efficient, this method is inherently data-driven and lacks mechanisms for incorporating physical laws, limiting its robustness and generalizability in data-scarce settings. Here, in this work, we propose PI-Latent-NO, a physics-informed latent neural operator framework that integrates governing physics directly into the learning process. Our architecture features two coupled DeepONets trained end-to-end: a Latent-DeepONet that learns a low-dimensional representation of the solution, and a Reconstruction-DeepONet that maps this latent representation back to the physical space. By embedding PDE constraints into the training via automatic differentiation, our method eliminates the need for labeled training data and ensures physics-consistent predictions. The proposed framework is both memory and compute-efficient, exhibiting near-constant scaling with problem size and demonstrating significant speedups over traditional physics-informed operator models. We validate our approach on a range of parametric PDEs, showcasing its accuracy, scalability, and suitability for real-time prediction in complex physical systems.

Latent representations↗