Search results for "numerical"
showing 10 items of 2002 documents
Computation of a few smallest eigenvalues of elliptic operators using fast elliptic solvers
2001
The computation of a few smallest eigenvalues of generalized algebraic eigenvalue problems is studied. The considered problems are obtained by discretizing self-adjoint second-order elliptic partial differential eigenvalue problems in two- or three-dimensional domains. The standard Lanczos algorithm with the complete orthogonalization is used to compute some eigenvalues of the inverted eigenvalue problem. Under suitable assumptions, the number of Lanczos iterations is shown to be independent of the problem size. The arising linear problems are solved using some standard fast elliptic solver. Numerical experiments demonstrate that the inverted problem is much easier to solve with the Lanczos…
The Calderón problem for the fractional Schrödinger equation
2020
We show global uniqueness in an inverse problem for the fractional Schr\"odinger equation: an unknown potential in a bounded domain is uniquely determined by exterior measurements of solutions. We also show global uniqueness in the partial data problem where the measurements are taken in arbitrary open, possibly disjoint, subsets of the exterior. The results apply in any dimension $\geq 2$ and are based on a strong approximation property of the fractional equation that extends earlier work. This special feature of the nonlocal equation renders the analysis of related inverse problems radically different from the traditional Calder\'on problem.
Comparative Study of the a Posteriori Error Estimators for the Stokes Problem
2007
The research presented is focused on a comparative study of a posteriori error estimation methods to various approximations of the Stokes problem. Mainly, we are interested in the performance of functional type a posterior error estimates and their comparison with other methods. We show that functional type a posteriori error estimators are applicable to various types of approximations (including non-Galerkin ones) and robust with respect to the mesh structure, type of the finite element and computational procedure used. This allows the construction of effective mesh adaptation procedures in all cases considered. Numerical tests justify the approach suggested.
The Windy clustered prize-collecting arc-routing problem
2011
This paper introduces the windy clustered prize-collecting arc-routing problem. It is an arc-routing problem where each demand edge is associated with a profit that is collected once if the edge is serviced, independent of the number of times the edge is traversed. It is further required that if a demand edge is serviced, then all the demand edges of its component are also serviced. A mathematical programming formulation is given and some polyhedral results including several facet-defining and valid inequalities are presented. The separation problem for the different families of inequalities is studied. Numerical results from computational experiments are analyzed. © 2011 INFORMS.
Qualitative Analysis of Differential, Difference Equations, and Dynamic Equations on Time Scales
2015
and Applied Analysis 3 thank Guest Editors Josef Dibĺik, Alexander Domoshnitsky, Yuriy V. Rogovchenko, Felix Sadyrbaev, and Qi-Ru Wang for their unfailing support with editorial work that ensured timely preparation of this special edition. Tongxing Li Josef Dibĺik Alexander Domoshnitsky Yuriy V. Rogovchenko Felix Sadyrbaev Qi-Ru Wang
The Exponential Dichotomy under Discretization on General Approximation Scheme
2011
This paper is devoted to the numerical analysis of abstract parabolic problem 𝑢 ( 𝑡 ) = 𝐴 𝑢 ( 𝑡 ) ; 𝑢 ( 0 ) = 𝑢 0 , with hyperbolic generator 𝐴 . We are developing a general approach to establish a discrete dichotomy in a very general setting in case of discrete approximation in space and time. It is a well-known fact that the phase space in the neighborhood of the hyperbolic equilibrium can be split in a such way that the original initial value problem is reduced to initial value problems with exponential decaying solutions in opposite time direction. We use the theory of compact approximation principle and collectively condensing approximation to show that such a decomposition o…
A new method for optimal synthesis of wavelet-based neural networks suitable for identification purposes
1999
Abstract This paper deals with a new method for optimal synthesis of Wavelet-Based Neural Networks (WBNN) suitable for identification purposes. The method uses a genetic algorithm (GA) combined with a steepest descent technique and least square techniques for both optimal selection of the structure of the WBNN and its training. The method is applied for designing a predictor for a chaotic temporal series
Regularized RBF Networks for Hyperspectral Data Classification
2004
In this paper, we analyze several regularized types of Radial Basis Function (RBF) Networks for crop classification using hyperspectral images. We compare the regularized RBF neural network with Support Vector Machines (SVM) using the RBF kernel, and AdaBoost Regularized (ABR) algorithm using RBF bases, in terms of accuracy and robustness. Several scenarios of increasing input space dimensionality are tested for six images containing six crop classes. Also, regularization, sparseness, and knowledge extraction are paid attention.
Induced scalarization in boson stars and scalar gravitational radiation
2012
The dynamical evolution of boson stars in scalar-tensor theories of gravity is considered in the physical (Jordan) frame. We focus on the study of spontaneous and induced scalarization, for which we take as initial data configurations on the well-known S-branch of a single boson star in general relativity. We show that during the scalarization process a strong emission of scalar radiation occurs. The new stable configurations (S-branch) of a single boson star within a particular scalar-tensor theory are also presented.
Minimally implicit Runge-Kutta methods for Resistive Relativistic MHD
2016
The Relativistic Resistive Magnetohydrodynamic (RRMHD) equations are a hyperbolic system of partial differential equations used to describe the dynamics of relativistic magnetized fluids with a finite conductivity. Close to the ideal magnetohydrodynamic regime, the source term proportional to the conductivity becomes potentially stiff and cannot be handled with standard explicit time integration methods. We propose a new class of methods to deal with the stiffness fo the system, which we name Minimally Implicit Runge-Kutta methods. These methods avoid the development of numerical instabilities without increasing the computational costs in comparison with explicit methods, need no iterative …