Results 281 to 290 of about 369,812 (312)
Some of the next articles are maybe not open access.
2021
The objective of this chapter is to describe techniques that preserve the invariant domain property of the algorithm introduced in the previous chapter and increase its accuracy in time and space. The argumentation for the time approximation is done for general hyperbolic systems, but the argumentation for the space approximation is done for scalar ...
Alexandre Ern, Jean-Luc Guermond
openaire +1 more source
The objective of this chapter is to describe techniques that preserve the invariant domain property of the algorithm introduced in the previous chapter and increase its accuracy in time and space. The argumentation for the time approximation is done for general hyperbolic systems, but the argumentation for the space approximation is done for scalar ...
Alexandre Ern, Jean-Luc Guermond
openaire +1 more source
Spectral Approximation of Third-Order Problems
Journal of Scientific Computing, 1999The author introduces a Chebyshev collocation method for the partial differential equation \(u_t = u_{xxx}\) on the set \((x, t) \in (-1, 1) \times (0, T]\). The boundary conditions are of a Dirichlet sort which ensure stability. A computational investigation suggests that collocation at the Gauss-Lobatto points produces a stable numerical method.
openaire +2 more sources
Journal of Circuits, Systems and Computers, 2023
The use of fractional-order (FO) calculus for the solution of different problems in many fields has increased recently. However, the usage of FO system models in practice brings some difficulties. The FO operator, fractance device, is usually realized via several integer-order approximation methods, which have pros and cons in the aspect of operation ...
openaire +1 more source
The use of fractional-order (FO) calculus for the solution of different problems in many fields has increased recently. However, the usage of FO system models in practice brings some difficulties. The FO operator, fractance device, is usually realized via several integer-order approximation methods, which have pros and cons in the aspect of operation ...
openaire +1 more source
Reduced order approximation of incommensurate fractional order systems
2019 IEEE Conference on Control Technology and Applications (CCTA), 2019Model order approximation of an incommensurate fractional order system is a highly challenging problem by any analytical technique. In view of this, a simple and a computationally efficient approach is proposed for the model order reduction of incommensurate fractional order systems. The proposed approach is based on FOMCON toolbox of MATLAB and hybrid
Shivam Jain, Yogesh V. Hote
openaire +1 more source
1995
Abstract We have shown that the central limit theorem can be used to calculate useful approximations to both univariate and multivariate pdfs that are generally easy to evaluate numerically. However, there are circumstances in which Gaussian approximations may be qualitatively inaccurate.
Uri Shmueli, George H Weiss
openaire +1 more source
Abstract We have shown that the central limit theorem can be used to calculate useful approximations to both univariate and multivariate pdfs that are generally easy to evaluate numerically. However, there are circumstances in which Gaussian approximations may be qualitatively inaccurate.
Uri Shmueli, George H Weiss
openaire +1 more source
2016
Two-level factorial or fractional factorial experimental designs are used for obtaining a first-order approximation to the response function. They are particularly useful for selecting a smaller subset of potential input factors with which to formulate a better approximation equation.
openaire +1 more source
Two-level factorial or fractional factorial experimental designs are used for obtaining a first-order approximation to the response function. They are particularly useful for selecting a smaller subset of potential input factors with which to formulate a better approximation equation.
openaire +1 more source
2011
Because optimal policies require the solution of an m – 1 dimensional dynamic program, finding optimal policies is feasible only for moderately small values of m. For that reason, approximate policies are of particular interest. The first issue to be addressed when trying to find approximations is the form of the approximate policy.
openaire +1 more source
Because optimal policies require the solution of an m – 1 dimensional dynamic program, finding optimal policies is feasible only for moderately small values of m. For that reason, approximate policies are of particular interest. The first issue to be addressed when trying to find approximations is the form of the approximate policy.
openaire +1 more source
A fourth-order approximation of fractional derivatives with its applications
Journal of Computational Physics, 2015Zhao-Peng Hao, Zhi-Zhong Sun
exaly
New study on neural networks: the essential order of approximation
Neural Networks, 2010Jianjun Wang
exaly