اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدInitial Value Problems and Signature Change
70
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We make a rigorous study of classical field equations on a 2-dimensional signature changing spacetime using the techniques of operator theory. Boundary conditions at the surface of signature change are determined by forming self-adjoint extensions of the Schrodinger Hamiltonian. We show that the initial value problem for the Klein--Gordon equation on this spacetime is ill-posed in the sense that its solutions are unstable. Furthermore, if the initial data is smooth and compactly supported away from the surface of signature change, the solution has divergent $L^2$-norm after finite time.
قيم البحث
اقرأ أيضاً
The proposal of the possibility of change of signature in quantum cosmology has led to the study of this phenomenon in classical general relativity theory, where there has been some controversy about what is and is not possible. We here present a new
analysis of such a change of signature, based on previous studies of the initial value problem in general relativity. We emphasize that there are various continuity suppositions one can make at a classical change of signature, and consider more general assumptions than made up to now. We confirm that in general such a change can take place even when the second fundamental form of the surface of change does not vanish.
Boundary problem for Tolman-Bondi model is formulated. One-to-one correspondence between singularities hypersurfaces and initial conditions of the Tolman-Bondi model is constructed.
ODE Test Problems (OTP) is an object-oriented MATLAB package offering a broad range of initial value problems which can be used to test numerical methods such as time integration methods and data assimilation (DA) methods. It includes problems that a
re linear and nonlinear, homogeneous and nonhomogeneous, autonomous and nonautonomous, scalar and high-dimensional, stiff and nonstiff, and chaotic and nonchaotic. Many are real-world problems from fields such as chemistry, astrophysics, meteorology, and electrical engineering. OTP also supports partitioned ODEs for testing IMEX methods, multirate methods, and other multimethods. Functions for plotting solutions and creating movies are available for all problems, and exact solutions are provided when available. OTP is desgined for ease of use-meaning that working with and modifying problems is simple and intuitive.
This work focuses on the construction of a new class of fourth-order accurate methods for multirate time evolution of systems of ordinary differential equations. We base our work on the Recursive Flux Splitting Multirate (RFSMR) version of the Multir
ate Infinitesimal Step (MIS) methods and use recent theoretical developments for Generalized Additive Runge-Kutta methods to propose our higher-order Relaxed Multirate Infinitesimal Step extensions. The resulting framework supports a range of attractive properties for multirate methods, including telescopic extensions, subcycling, embeddings for temporal error estimation, and support for changes to the fast/slow time-scale separation between steps, without requiring any sacrifices in linear stability. In addition to providing rigorous theoretical developments for these new methods, we provide numerical tests demonstrating convergence and efficiency on a suite of multirate test problems.
Several neural network approaches for solving differential equations employ trial solutions with a feedforward neural network. There are different means to incorporate the trial solution in the construction, for instance one may include them directly
in the cost function. Used within the corresponding neural network, the trial solutions define the so-called neural form. Such neural forms represent general, flexible tools by which one may solve various differential equations. In this article we consider time-dependent initial value problems, which require to set up the neural form framework adequately. The neural forms presented up to now in the literature for such a setting can be considered as first order polynomials. In this work we propose to extend the polynomial order of the neural forms. The novel collocation-type construction includes several feedforward neural networks, one for each order. Additionally, we propose the fragmentation of the computational domain into subdomains. The neural forms are solved on each subdomain, whereas the interfacing grid points overlap in order to provide initial values over the whole fragmentation. We illustrate in experiments that the combination of collocation neural forms of higher order and the domain fragmentation allows to solve initial value problems over large domains with high accuracy and reliability.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
