scholarly journals Approximate solutions for expanding search games on general networks

2018 ◽  
Vol 275 (2) ◽  
pp. 259-279 ◽  
Author(s):  
Steve Alpern ◽  
Thomas Lidbetter
2000 ◽  
Vol 3 ◽  
pp. 1
Author(s):  
Y STAMATIOU ◽  
D THILIKOS
Keyword(s):  

1985 ◽  
Vol 13 (3) ◽  
pp. 127-146 ◽  
Author(s):  
R. Prabhakaran

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.


Author(s):  
Alexander D. Bekman ◽  
Sergey V. Stepanov ◽  
Alexander A. Ruchkin ◽  
Dmitry V. Zelenin

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.


Mathematics ◽  
2019 ◽  
Vol 7 (10) ◽  
pp. 923 ◽  
Author(s):  
Abdul Ghafoor ◽  
Sirajul Haq ◽  
Manzoor Hussain ◽  
Poom Kumam ◽  
Muhammad Asif Jan

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.


NeuroSci ◽  
2021 ◽  
Vol 2 (1) ◽  
pp. 75-94
Author(s):  
Kulpreet Cheema ◽  
William E. Hodgetts ◽  
Jacqueline Cummine

Much work has been done to characterize domain-specific brain networks associated with reading, but very little work has been done with respect to spelling. Our aim was to characterize domain-specific spelling networks (SpNs) and domain-general resting state networks (RSNs) in adults with and without literacy impairments. Skilled and impaired adults were recruited from the University of Alberta. Participants completed three conditions of an in-scanner spelling task called a letter probe task (LPT). We found highly connected SpNs for both groups of individuals, albeit comparatively more connections for skilled (50) vs. impaired (43) readers. Notably, the SpNs did not correlate with spelling behaviour for either group. We also found relationships between SpNs and RSNs for both groups of individuals, this time with comparatively fewer connections for skilled (36) vs. impaired (53) readers. Finally, the RSNs did predict spelling performance in a limited manner for the skilled readers. These results advance our understanding of brain networks associated with spelling and add to the growing body of literature that describes the important and intricate connections between domain-specific networks and domain-general networks (i.e., resting states) in individuals with and without developmental disorders.


Sign in / Sign up

Export Citation Format

Share Document