II Approximate solutions

2006 ◽  
pp. 159-160
Keyword(s):  
Approximate Solutions

Interactive Graphics for the Analysis of Tires

1985 ◽  
Vol 13 (3) ◽  
pp. 127-146 ◽  
Author(s):  
R. Prabhakaran
Keyword(s):  
Finite Element Analysis ◽  
Finite Element ◽  
Approximate Solutions ◽  
Interactive Graphics ◽  
Element Analysis ◽  
Analysis Process ◽  
Physical Problems ◽  
The Finite Element Analysis ◽  
Analysis Computer ◽  
Discretization Technique

Abstract The finite element method, which is a numerical discretization technique for obtaining approximate solutions to complex physical problems, is accepted in many industries as the primary tool for structural analysis. Computer graphics is an essential ingredient of the finite element analysis process. The use of interactive graphics techniques for analysis of tires is discussed in this presentation. The features and capabilities of the program used for pre- and post-processing for finite element analysis at GenCorp are included.

A new algorithm for finding CRM-model coefficients

2019 ◽  
Vol 5 (3) ◽  
pp. 164-185 ◽  
Author(s):  
Alexander D. Bekman ◽  
Sergey V. Stepanov ◽  
Alexander A. Ruchkin ◽  
Dmitry V. Zelenin
Keyword(s):  
Approximate Solution ◽  
Optimization Problem ◽  
Optimal Solution ◽  
Complex Form ◽  
Approximate Solutions ◽  
The Other ◽  
Programming Algorithm ◽  
Stochastic Algorithms ◽  
Large Set ◽  
Flow Rates

The quantitative evaluation of producer and injector well interference based on well operation data (profiles of flow rates/injectivities and bottomhole/reservoir pressures) with the help of CRM (Capacitance-Resistive Models) is an optimization problem with large set of variables and constraints. The analytical solution cannot be found because of the complex form of the objective function for this problem. Attempts to find the solution with stochastic algorithms take unacceptable time and the result may be far from the optimal solution. Besides, the use of universal (commercial) optimizers hides the details of step by step solution from the user, for example&nbsp;— the ambiguity of the solution as the result of data inaccuracy.<br> The present article concerns two variants of CRM problem. The authors present a new algorithm of solving the problems with the help of “General Quadratic Programming Algorithm”. The main advantage of the new algorithm is the greater performance in comparison with the other known algorithms. Its other advantage is the possibility of an ambiguity analysis. This article studies the conditions which guarantee that the first variant of problem has a unique solution, which can be found with the presented algorithm. Another algorithm for finding the approximate solution for the second variant of the problem is also considered. The method of visualization of approximate solutions set is presented. The results of experiments comparing the new algorithm with some previously known are given.

scholarly journals Approximate Solutions of Time Fractional Diffusion Wave Models

Mathematics ◽  
2019 ◽  
Vol 7 (10) ◽  
pp. 923 ◽  
Author(s):  
Abdul Ghafoor ◽  
Sirajul Haq ◽  
Manzoor Hussain ◽  
Poom Kumam ◽  
Muhammad Asif Jan
Keyword(s):  
Finite Difference ◽  
Wave Equations ◽  
Quadrature Rule ◽  
Approximate Solutions ◽  
Fractional Diffusion ◽  
Haar Wavelets ◽  
Test Problems ◽  
Algebraic Equations ◽  
Diffusion Wave ◽  
Wave Models

In this paper, a wavelet based collocation method is formulated for an approximate solution of (1 + 1)- and (1 + 2)-dimensional time fractional diffusion wave equations. The main objective of this study is to combine the finite difference method with Haar wavelets. One and two dimensional Haar wavelets are used for the discretization of a spatial operator while time fractional derivative is approximated using second order finite difference and quadrature rule. The scheme has an excellent feature that converts a time fractional partial differential equation to a system of algebraic equations which can be solved easily. The suggested technique is applied to solve some test problems. The obtained results have been compared with existing results in the literature. Also, the accuracy of the scheme has been checked by computing L 2 and L ∞ error norms. Computations validate that the proposed method produces good results, which are comparable with exact solutions and those presented before.

scholarly journals Diffusion approximations for randomly arriving expert opinions in a financial market with Gaussian drift

2021 ◽  
Vol 58 (1) ◽  
pp. 197-216 ◽  
Author(s):  
Jörn Sass ◽  
Dorothee Westphal ◽  
Ralf Wunderlich
Keyword(s):  
Stock Returns ◽  
Financial Market ◽  
Discrete Time ◽  
High Frequency ◽  
Utility Maximization ◽  
Limit Theorems ◽  
Approximate Solutions ◽  
Diffusion Approximations ◽  
Expert Opinions ◽  
Arrival Intensity

AbstractThis paper investigates a financial market where stock returns depend on an unobservable Gaussian mean reverting drift process. Information on the drift is obtained from returns and randomly arriving discrete-time expert opinions. Drift estimates are based on Kalman filter techniques. We study the asymptotic behavior of the filter for high-frequency experts with variances that grow linearly with the arrival intensity. The derived limit theorems state that the information provided by discrete-time expert opinions is asymptotically the same as that from observing a certain diffusion process. These diffusion approximations are extremely helpful for deriving simplified approximate solutions of utility maximization problems.

A stochastic operational matrix method for numerical solutions of multi-dimensional stochastic Itô–Volterra integral equations

2020 ◽  
Vol 28 (3) ◽  
pp. 209-216
Author(s):  
S. Singh ◽  
S. Saha Ray
Keyword(s):  
Integral Equations ◽  
Numerical Solutions ◽  
Operational Matrix ◽  
Approximate Solutions ◽  
Volterra Integral Equations ◽  
Numerical Examples ◽  
Operational Matrix Method ◽  
Block Pulse Functions ◽  
Stochastic Operational Matrix ◽  
Block Pulse Function

AbstractIn this article, hybrid Legendre block-pulse functions are implemented in determining the approximate solutions for multi-dimensional stochastic Itô–Volterra integral equations. The block-pulse function and the proposed scheme are used for deriving a methodology to obtain the stochastic operational matrix. Error and convergence analysis of the scheme is discussed. A brief discussion including numerical examples has been provided to justify the efficiency of the mentioned method.

scholarly journals Combined Games with Randomly Delayed Beginnings

Mathematics ◽  
2021 ◽  
Vol 9 (5) ◽  
pp. 534
Author(s):  
F. Thomas Bruss
Keyword(s):  
Discrete Time ◽  
Real World ◽  
Optimal Stopping ◽  
Random Variables ◽  
Approximate Solutions ◽  
Real World Problems

This paper presents two-person games involving optimal stopping. As far as we are aware, the type of problems we study are new. We confine our interest to such games in discrete time. Two players are to chose, with randomised choice-priority, between two games G1 and G2. Each game consists of two parts with well-defined targets. Each part consists of a sequence of random variables which determines when the decisive part of the game will begin. In each game, the horizon is bounded, and if the two parts are not finished within the horizon, the game is lost by definition. Otherwise the decisive part begins, on which each player is entitled to apply their or her strategy to reach the second target. If only one player achieves the two targets, this player is the winner. If both win or both lose, the outcome is seen as “deuce”. We motivate the interest of such problems in the context of real-world problems. A few representative problems are solved in detail. The main objective of this article is to serve as a preliminary manual to guide through possible approaches and to discuss under which circumstances we can obtain solutions, or approximate solutions.

Sign in / Sign up

Export Citation Format

Share Document