Results 211 to 220 of about 5,613,115 (248)
Some of the next articles are maybe not open access.
Elementary Soft and Stiff Problems
1994For a large class of homogenization problems the given periodic matrix A(x) satisfies the usual inequality v1I ≤ A(x) ≤ v2I (v1, v2 > 0) at all points of ℝ m outside certain subsets, called inclusions, where the matrix A(x) is degenerate. Two main types of degeneration are usually considered: if A(x) = 0, then we speak of soft inclusions, or a soft ...
V. V. Jikov, S. M. Kozlov, O. A. Oleinik
openaire +1 more source
2002
This chapter discusses some techniques for handling stiff and singular problems, using Chebyshev methods. The solution of a stiff problem is regular but exhibits large variations in a region of small extent. For convergence reasons, the collocation points cannot be clustered arbitrarily in the rapid variation region, so that an appropriate distribution
openaire +1 more source
This chapter discusses some techniques for handling stiff and singular problems, using Chebyshev methods. The solution of a stiff problem is regular but exhibits large variations in a region of small extent. For convergence reasons, the collocation points cannot be clustered arbitrarily in the rapid variation region, so that an appropriate distribution
openaire +1 more source
A Problem-Dependent Formula of Damping for Stiff Problems
International Journal of Computational MethodsA matrix coefficient formula of damping is developed to solve stiff problems. This is a matrix coefficient formula that has L-stability, explicitness and 2nd-order accuracy. It possesses damping to suppress or eliminate the negligible stiff components of the problems under analysis.
Chiu-Li Huang +2 more
openaire +1 more source
Multistep Methods for Stiff Problems
1991Multistep methods (BDF) were the first numerical methods to be proposed for stiff differential equations (Curtiss & Hirschfelder 1952) and since Gear’s book (1971) computer codes based on these methods have been the most prominent and most widely used for all stiff computations.
Ernst Hairer, Gerhard Wanner
openaire +1 more source
A Noniterative Problem-Dependent Formula for Stiff Dynamic Problems
Journal of Computational and Nonlinear Dynamics, 2022Abstract A novel one-step formula is proposed for solving initial value problems based on a concept of eigenmode. It is characterized by problem dependency since it has problem-dependent coefficients, which are functions of the product of the step size and the initial physical properties to define the problem under analysis.
openaire +1 more source
A definition of stiff differential problems
USSR Computational Mathematics and Mathematical Physics, 1984Translation from Zh. Vychisl. Mat. Mat. Fiz. 24, No.4, 599-601 (Russian) (1984; Zbl 0559.65053).
openaire +2 more sources
‘A stiff is still a stiff in this country’: the Problem of Murder in Wartime
2010My title comes from Margery Allingham’s 1945 novel Coroner’s Pidgin, and its absurd assertion of moral force is indicative of the contradictions pervading popular fiction in wartime. The words are spoken by Magersfontein Lugg, erstwhile manservant to Allingham’s series detective Albert Campion, and they take the form of a reproach.
openaire +1 more source
Mode pushing and stiff convergent problems
IEEE Transactions on Magnetics, 1983Stiff Convergent Problems are the ones that have some modes that converge very slowly when solved using iterative techniques. Mode pushing (MP), superimposed on these techniques, is a method of accelerating convergence of only these modes. This paper discusses the theory of the MP method and a practical algorithm which estimates the stiff convergent ...
M. Torfeh-Isfahani, E. Della Torre
openaire +1 more source
(2,1)-Method for solving stiff nonautonomous problems
Automation and Remote Control, 2012zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Order and stability of parallel methods for stiff problems
Advances in Computational Mathematics, 1997The author explores a special class of general linear methods for stiff problems, introduced earlier by himself and known in the literature as diagonally implicit multistage integration methods of type 4. This is a preliminary study of such methods. A particular choice of the coefficient matrix allows the parallel evaluation of the stages.
openaire +3 more sources

