Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Mathematics & Computing”

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

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

At least 1,279 records · Page 71

On Two Algorithms of Wavelet Decomposition for Spaces of Linear Splines

The purpose of this paper is to construct new types of wavelets for minimal splines on an irregular grid. The approach applied to construct spline-wavelet decompositions uses approximation relations as an initial structure for constructing the spaces of minimal splines. The advantages of this approach are the possibilities of using irregular grids and sufficiently arbitrary nonpolynomial spline-wavelets.

97 MATHEMATICS AND COMPUTING↗

Elliptic G-Operators on Manifolds with Isolated Singularities

In the present work we study elliptic operators on manifolds with singularities in the situation where the manifold is endowed with an action of a discrete group G. As usual in elliptic theory, the Fredholm property of an operator is governed by the properties of its principal symbol. We show that the principal symbol in our situation is a pair consisting of the symbol on the main stratum (interior symbol) and the symbol at the conical point (conormal symbol). The Fredholm property of elliptic elements is obtained.

97 MATHEMATICS AND COMPUTING↗

Factorization of generalized γ-generating matrices

The class of γ-generating matrices and its subclasses of regular and singular γ-generating matrices were introduced by D. Z. Arov in [8], where it was shown that every γ-generating matrix admits an essentially unique regular–singular factorization. The class of generalized γ-generating matrices was introduced in [14, 20]. In the present paper, subclasses of singular and regular generalized –generating matrices are introduced and studied. As the main result, a theorem of existence of the regular–singular factorization for a rational generalized γ-generating matrix is proved.

97 MATHEMATICS AND COMPUTING↗

Structure of Rank-One Matrices Over the Domain of Principal Ideals Relative to Similarity Transformations

We study the structure of rank-one matrices over the domain of principal ideals relative to equivalence and similarity transformations. The canonical form of rank-one matrices relative to similarity transformations is established. We propose conditions under which a pair of rank-one matrices is reduced to the triangular form by a similarity transformation.

97 MATHEMATICS AND COMPUTING↗

Traveling waves for the mass in mass model of granular chains

In this work, we consider the mass in mass (or mass with mass) system of granular chains, namely, a granular chain involving additionally an internal (or, respectively, external) resonator. For these chains, we rigorously establish that under suitable “anti-resonance” conditions connecting the mass of the resonator and the speed of the wave, bell-shaped traveling-wave solutions continue to exist in the system, in a way reminiscent of the results proven for the standard granular chain of elastic Hertzian contacts. Finally, we also numerically touch upon settings, where the conditions do not hold, illustrating, in line also with recent experimental work, that non-monotonic waves bearing non-vanishing tails may exist in the latter case.

36 MATERIALS SCIENCE↗

Spatially dependent regularization parameter selection for total generalized variation-based image denoising

We propose a novel image denoising model based on the total generalized variation (TGV) regularization. In the model, a spatially dependent regularization parameter is utilized to adaptively fit the local image features, resulting in further exploitation of the denoising potential of the TGV regularization. The proposed model is formulated under a joint optimization framework, by which the estimations of the restored image and the regularization parameter are achieved simultaneously. Furthermore, the model is general purpose that can handle various types of noise occurring in image processing. An alternating minimization-based numerical scheme is especially developed, which leads to an efficient algorithmic solution to the nonconvex optimization problem. Numerical experiments are reported to illustrate the effectiveness of our model in terms of both peak signal-to-noise ratio and visual perception.

97 MATHEMATICS AND COMPUTING↗

On the periodic solutions of the Michelson continuous and discontinuous piecewise linear differential system

Applying new results from the averaging theory for continuous and discontinuous differential systems, we study the periodic solutions of two distinct versions of the Michelson differential system: a Michelson continuous piecewise linear differential system and a Michelson discontinuous piecewise linear differential system. The tools here used can be applied to general nonsmooth differential systems.

97 MATHEMATICS AND COMPUTING↗

Painlevé–Kuratowski convergences of the solution sets for generalized vector quasi-equilibrium problems

In this paper, we consider vector quasi-equilibrium problems under perturbation in terms of suitable asymptotically solving sequences, not embedding given problems into a parameterized family. By employing some types of convergences for mapping and set sequences, we obtain the Painlevé–Kuratowski upper convergence of solution sets for the reference problems. Then, using nonlinear scalarization functions, we propose gap functions for such problems, and later employing these functions, we study necessary and sufficient conditions for Painlevé–Kuratowski lower convergence and Painlevé–Kuratowski convergence. As an application, we discuss the special case of vector quasi-variational inequality.

97 MATHEMATICS AND COMPUTING↗

An elliptic regularity theorem for fractional partial differential operators

We present and prove a version of the elliptic regularity theorem for partial differential equations involving fractional Riemann–Liouville derivatives. In this case, regularity is defined in terms of Sobolev spaces H{sup s}(X): if the forcing of a linear elliptic fractional PDE is in one Sobolev space, then the solution is in the Sobolev space of increased order corresponding to the order of the derivatives. We also mention a few applications and potential extensions of this result.

97 MATHEMATICS AND COMPUTING↗

Partitioned exponential methods for coupled multiphysics systems

Multiphysics problems involving two or more coupled physical phenomena are ubiquitous in science and engineering. This work develops a new partitioned exponential approach for the time integration of multiphysics problems. After a possible semi-discretization in space, the class of problems under consideration is modeled by a system of ordinary differential equations where the right-hand side is a summation of two component functions, each corresponding to a given set of physical processes. The partitioned-exponential methods proposed herein evolve each component of the system via an exponential integrator, and information between partitions is exchanged via coupling terms. Here, the traditional approach to constructing exponential methods, based on the variation-of-constants formula, is not directly applicable to partitioned systems. Rather, our approach to developing new partitioned-exponential families is based on a general-structure additive formulation of the schemes. Two method formulations are considered, one based on a linear-nonlinear splitting of the right hand component functions, and another based on approximate Jacobians. The paper develops classical (non-stiff) order conditions theory for partitioned exponential schemes based on particular families of T-trees and B-series theory. Several practical methods of third order are constructed that extend the Rosenbrock-type and EPIRK families of exponential integrators. Several implementation optimizations specific to the application of these methods to reaction-diffusion systems are also discussed. Numerical experiments reveal that the new partitioned-exponential methods can perform better than traditional unpartitioned exponential methods on some problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The W4 method: A new multi-dimensional root-finding scheme for nonlinear systems of equations

We propose a new class of method for solving nonlinear systems of equations, which, among other things, has four nice features: (i) it is inspired by the mathematical property of damped oscillators, (ii) it can be regarded as a simple extension to the Newton-Raphson (NR) method, (iii) it has the same local convergence as the NR method does, (iv) it has a significantly wider convergence region or the global convergence than that of the NR method. In this article, we present the evidence of these properties, applying our new method to some examples and comparing it with the NR method.

97 MATHEMATICS AND COMPUTING↗

Bounded extremum seeking with discontinuous dithers

The analysis of discontinuous extremum seeking (ES) controllers, e.g. those applicable to digital systems, has historically been more complicated than that of continuous controllers. We establish a simple and general extension of a recently developed bounded form of ES to a general class of oscillatory functions, including functions discontinuous with respect to time, such as triangle or square waves with dead time. We establish our main results by combining a novel idea for oscillatory control with an extension of functional analytic techniques originally utilized by Kurzweil, Jarnik, Sussmann, and Liu in the late 80s and early 90s and recently studied by Durr et al. Lastly, we demonstrate the value of the result with an application to inverter switching control.

97 MATHEMATICS AND COMPUTING↗

Tracer particle transport dynamics in the diffusive sandpile cellular automaton

The confinement properties of the diffusive running sandpile are characterized by tracking the motion of a population of marked grains of sand. It is found that, as the relative strength of the avalanching to the diffusive transport channel is varied, a point is reached at which the particle global confinement time and the probability density functions of the jump-sizes and waiting-times of the tracked grains experience a sudden change, thus revealing a dynamical transition, that is consistent with previous studies (Newman DE et al., Phys Rev Lett 2002;88(20):204304). Across this transition, the sandpile moves from a regime characterized by self-similarity and memory, where avalanches of all possible sizes dominate transport across the system, to another regime where transport is taken over by near system-size, quasi-periodic avalanches. Values for the fractional transport exponents that quantify effective transport across the sandpile prior to the transition are also obtained.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An efficient reconstruction algorithm for diffusion on triangular grids using the nodal discontinuous Galerkin method

High-energy-density (HED) hydrodynamics studies such as those relevant to inertial confinement fusion and astrophysics require highly disparate densities, temperatures, viscosities, and other diffusion parameters over relatively short spatial scales. This presents a challenge for high-order accurate methods to effectively resolve the hydrodynamics at these scales, particularly in the presence of highly disparate diffusion. A significant volume of engineering and physics applications use an unstructured discontinuous Galerkin (DG) method developed based on the finite element mesh generation and algorithmic framework. This work discusses the application of an affine reconstructed nodal DG method for unstructured grids of triangles. Solving the diffusion terms in the DG method is non-trivial due to the solution representations being piecewise continuous. Hence, the diffusive flux is not defined on the interface of elements. The proposed numerical approach reconstructs a smooth solution in a parallelogram that is enclosed by the quadrilateral formed by two adjacent triangle elements. The interface between these two triangles is the diagonal of the enclosed parallelogram. Similar to triangles, the mapping of parallelograms from a physical domain to a reference domain is an affine mapping, which is necessary for an accurate and efficient implementation of the numerical algorithm. Thus, all computations can still be performed on the reference domain, which promotes efficiency in computation and storage. This reconstruction does not make assumptions on choice of polynomial basis. Reconstructed DG algorithms have previously been developed for modal implementations of the convection–diffusion equations. However, to the best of the authors’ knowledge, this is the first practical guideline that has been proposed for applying the reconstructed algorithm on a nodal discontinuous Galerkin method with a focus on accuracy and efficiency. As a result, the algorithm is demonstrated on a number of benchmark cases as well as a challenging substantive problem in HED hydrodynamics with highly disparate diffusion parameters.

Computational efficiency↗