Search NASA⌕ Search

SEARCH · Search NASA

Results for “boundary value problems”

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 37 records · Page 2

On the Solvability of a Boundary-Value Problem for a Second-Order Singular Quasilinear Equation

We obtain solvability conditions for a two-point boundary-value problem for a second-order quasilinear equation. The equation is singular with respect to the independent variable. The result is based on the properties of the Green operator of the corresponding linear problem. In particular, we prove its boundedness and obtain an upper estimate of its norm. Conditions of existence of a solution of the original problem are obtained from the solvability condition of an auxiliary operator equation.

97 MATHEMATICS AND COMPUTING↗

Solutions of Boundary-Value Problems for the Helmholtz Equation in Simply Connected Domains of the Complex Plane

The bases in the spaces of functions analytic in simply connected domains are constructed with the help of conformal mappings of these domains onto a circle. The obtained basis functions are biorthogonal to the Faber polynomials. By using the expansions of analytic functions in series in systems of basis functions, we determine the solutions of boundary-value problems for the Helmholtz equation whose boundary values coincide with the boundary values of these functions.

97 MATHEMATICS AND COMPUTING↗

On Periodic Boundary-Value Problems for Systems of Functional-Differential Equations

We obtain necessary and sufficient conditions for the existence of a unique solution to a periodic boundary-value problem for all systems of first-order functional-differential equations from a given family of systems. Families of systems of functional-differential equations are detrmined by the norms of positive functional operators of equations of the system. The verification of necessary and sufficient conditions of the existence of a unique periodic solution for all systems from a given family consists of the verification of positivity of a finite number of a real-valued functions defined on a finite-dimensional set.

97 MATHEMATICS AND COMPUTING↗

Analysis of the Spectral Stability of the Generalized Runge–Kutta Methods Applied to Initial-Boundary-Value Problems for Equations of the Parabolic Type. II. Implicit Methods

We consider specific realizations of different implicit generalized Runge–Kutta methods as applied to the numerical integration with respect to time of initial-boundary-value problems for the second-order parabolic equations and investigate their spectral stability. It is shown that all implicit generalized Runge–Kutta methods are unconditionally spectrally stable but some of them have the conditional property of monotonicity of the numerical solution with respect to time. The functions of spectral stability of the implicit generalized Runge–Kutta methods are rational. We compare the analytic solution of the nonstationary one-dimensional problem of heat conduction with the numerical solutions of this problem obtained by different implicit generalized Runge–Kutta methods. It is shown that, in this case, the application of the one-stage Radau methods with subsequent discretization of the problem with respect to the space variable leads to the classical forward finite difference scheme (Laasonen scheme), whereas the use of the one-stage Gauss–Legendre method leads to a six-point symmetric scheme (Crank–Nicolson scheme). It is shown that diagonally implicit generalized Nørsett and Burrage methods are realized in almost the same way as the one-stage Radau and Gauss–Legendre methods but their accuracy in the time step is 10–1000 times higher. On the basis of comparison of the numerical and analytic solutions, we conclude that, in order to get practically suitable numerical solutions without any restrictions on the time step, it is reasonable to use one- and three-stage generalized Radau methods or two- and four-stage Lobatto IIIC methods. All other explicit and implicit generalized Runge–Kutta methods require certain restrictions imposed on the time step.

42 ENGINEERING↗

Model Elliptic Boundary-Value Problems for Pseudodifferential Operators in Canonical Nonsmooth Domains

We consider a simplest elliptic pseudodifferential equation in a multi-dimensional cone (multi-dimensional angle) and describe all possible structures of its solutions related to the wave factorization of the elliptic symbol. Depending on the index of wave factorization, we consider various statements of well-posed boundary-value problems. The existence of solutions is studied in Sobolev–Slobodetskii spaces.

97 MATHEMATICS AND COMPUTING↗

Analysis of the Spectral Stability of the Generalized Runge–Kutta Methods Applied to Initial-Boundary-Value Problems for Equations of the Parabolic Type. I. Explicit Methods

We develop a general algorithm for the analysis the spectral stability of generalized multistage Runge–Kutta methods of various orders of accuracy as applied to the numerical integration with respect to time of an initial-boundary-value problem for the second-order parabolic equation. The expression for the function of spectral stability is obtained in two alternative forms: on the basis of matrix relations and in the determinant form. We study specific realizations of various generalized explicit Runge–Kutta methods and their spectral stability. It is shown that all explicit generalized Runge–Kutta methods possess the property of conditional spectral stability and the property of conditional monotonicity of the numerical solution in time whose violation leads to the appearance of false oscillations of the approximate solution. The stability function for these methods is polynomial. It is shown that the application of two-stage generalized explicit Runge–Kutta methods leads to the appearance of predictor-corrector-type schemes. In the case of nonstationary one-dimensional heat-conduction problem, on the basis of a one-stage generalized Runge–Kutta method, we obtain the classical two-layer conditionally stable explicit finite-difference scheme on a four-point template. It is demonstrated that the five-stage generalized Runge–Kutta–Merson method is characterized by the weakest condition of spectral stability as compared with all investigated explicit generalized Runge–Kutta methods.

42 ENGINEERING↗

Nonlocal Boundary-Value Problem for a Differential-Operator Equation with Weak Nonlinearity in the Spaces of Dirichlet–Taylor Series with Fixed Spectrum

We study the nonlocal boundary-value problem for a differential-operator equation with nonlinear right-hand side and an operator B = (B{sub 1},…B{sub p}), where its components B{sub j} ≡ z{sub j}∂/∂z{sub j}, j = 1,…,p, are the operators of generalized differentiation with respect to the complex variable z{sub j}. By using the Nash–Moser iterative scheme, we establish the conditions of solvability of this problem in the scale of spaces of functions of several complex variables, which are Dirichlet–Taylor series with fixed spectrum.

97 MATHEMATICS AND COMPUTING↗

Simulation of Linear Non-Hermitian Boundary-Value Problems with Quantum Singular-Value Transformation

Herein we propose a quantum algorithm for simulating dissipative waves in inhomogeneous linear media as a boundary-value problem. Using the so-called quantum singular value transformation (QSVT), we construct a quantum circuit that models the propagation of electromagnetic waves in a one-dimensional system with outgoing boundary conditions. The corresponding measurement procedure is also discussed. Limitations of the QSVT algorithm are identified in connection with the large condition numbers that the dispersion matrices exhibit at weak dissipation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Explicit block encodings of boundary value problems for many-body elliptic operators

Simulation of physical systems is one of the most promising use cases of future digital quantum computers. In this work we systematically analyze the quantum circuit complexities of block encoding the discretized elliptic operators that arise extensively in numerical simulations for partial differential equations, including high-dimensional instances for many-body simulations. When restricted to rectangular domains with separable boundary conditions, we provide explicit circuits to block encode the many-body Laplacian with separable periodic, Dirichlet, Neumann, and Robin boundary conditions, using standard discretization techniques from low-order finite difference methods. To obtain high-precision, we introduce a scheme based on periodic extensions to solve Dirichlet and Neumann boundary value problems using a high-order finite difference method, with only a constant increase in total circuit depth and subnormalization factor. We then present a scheme to implement block encodings of differential operators acting on more arbitrary domains, inspired by Cartesian immersed boundary methods. We then block encode the many-body convective operator, which describes interacting particles experiencing a force generated by a pair-wise potential given as an inverse power law of the interparticle distance. This work provides concrete recipes that are readily translated into quantum circuits, with depth logarithmic in the total Hilbert space dimension, that block encode operators arising broadly in applications involving the quantum simulation of quantum and classical many-body mechanics.

Kharazi, Tyler [University of California, Berkeley↗

On the convergence and convergence order of finite volume gradient schemes for oblique derivative boundary value problems

This work is an improvement of the previous note (Bradji in: Fuhrmann et al., Finite volumes for complex applications VII–methods, theoretical aspects. Proceedings of the FVCA 7, Berlin, 2014) which dealt with the convergence analysis of a finite volume scheme for the Poisson’s equation with a linear oblique derivative boundary condition. The formulation of the finite volume scheme given in Bradji (in: Fuhrmann et al., Finite volumes for complex applications VII–methods, theoretical aspects. Proceedings of the FVCA 7, Berlin, 2014) involves the discrete gradient introduced recently in Eymard et al. (IMA J Numer Anal 30(4):1009–1043, 2010). In this paper, we consider the convergence analysis of finite volume schemes involving the discrete gradient of Eymard et al. (IMA J Numer Anal 30(4):1009–1043, 2010) for elliptic and parabolic equations with linear oblique derivative boundary conditions. Linear oblique derivative boundary conditions arise for instance in the study of the motion of water in a canal, cf. Lesnic (Commun Numer Methods Eng 23(12):1071–1080, 2007). We derive error estimates in several norms which allow us to get error estimates for the approximations of the exact solutions and its first derivatives. In particular, we provide an error estimate between the gradient of the exact solutions and the discrete gradient of the approximate solutions. Convergence of the family of finite volume approximate solutions towards the exact solution under weak regularity assumption is also investigated. In the case of parabolic equations with oblique derivative boundary conditions, we develop a new discrete a priori estimate result. The proof of this result is based on the use of a discrete mean Poincaré–Wirtinger inequality. Thanks to the stated a priori estimate and to a comparison with an appropriately chosen auxiliary finite volume scheme, we derive the convergence results. This work can be viewed as a continuation of the previous work (Bradji and Gallouët in Int J Finite Vol 3(2):1–35, 2006) where a convergence analysis for a finite volume scheme, based on the admissible mesh of Eymard et al. (In: Ciarlet and Lions, Handbook of numerical analysis, North-Holland, Amsterdam, 2000), for the Poisson’s equation with a linear oblique derivative boundary conditions is given. The obtained convergence results do not require any relation between the mesh sizes of the spatial and time discretizations. Some numerical tests are presented for both elliptic and parabolic equations. In particular, we present three methods to compute the discrete solution.

97 MATHEMATICS AND COMPUTING↗