24 results
Search Results
2. A class of approximate inverse preconditioners for solving linear systems.
- Author
-
Zhang, Yong, Huang, Ting-Zhu, Liu, Xing-Ping, and Gu, Tong-Xiang
- Subjects
- *
MATRICES (Mathematics) , *LINEAR systems , *MATHEMATICS , *MATHEMATICAL ability , *NUMERICAL analysis , *MATHEMATICAL analysis , *EQUATIONS , *ALGEBRA , *MATHEMATICAL combinations , *LINEAR differential equations - Abstract
Some preconditioners for accelerating the classical iterative methods are given in Zhang et al. [Y. Zhang and T.Z. Huang, A class of optimal preconditioners and their applications, Proceedings of the Seventh International Conference on Matrix Theory and Its Applications in China, 2006. Y. Zhang, T.Z. Huang, and X.P. Liu, Modified iterative methods for nonnegative matrices and M-matrices linear systems, Comput. Math. Appl. 50 (2005), pp. 1587-1602. Y. Zhang, T.Z. Huang, X.P. Liu, A class of preconditioners based on the (I+S(α))-type preconditioning matrices for solving linear systems, Appl. Math. Comp. 189 (2007), pp. 1737-1748]. Another kind of preconditioners approximating the inverse of a symmetric positive definite matrix was given in Simons and Yao [G. Simons, Y. Yao, Approximating the inverse of a symmetric positive definite matrix, Linear Algebra Appl. 281 (1998), pp. 97-103]. Zhang et al. 's preconditioners and Simons and Yao's are generalized in this paper. These preconditioners are all of low construction cost, which all could be taken as approximate inverse of M-matrices. Numerical experiments of these preconditioners applied with Krylov subspace methods show the effectiveness and performance, which also show that the preconditioners proposed in this paper are better approximate inverse for M-matrices than Simons'. [ABSTRACT FROM AUTHOR]
- Published
- 2009
- Full Text
- View/download PDF
3. Supplement to: ‘Boundary stabilization of hyperbolic systems related to overhead cranes’ [H. Sano, IMA J. Math. Control Inf. (2008) vol. 25, 353–366, doi:10.1093/imamci/dnm031].
- Author
-
SANO, HIDEKI
- Subjects
- *
EQUATIONS , *NUMERICAL analysis , *SYMMETRY (Physics) , *MATHEMATICAL analysis , *MATHEMATICS - Abstract
In the paper cited in the heading, we treated the problem of stabilizing a flexible cable with two rigid loads, which was described by two kinds of hyperbolic equations. To show the asymptotic stability of the closed-loop system with a controller derived there, we used the LaSalle's invariance principle. However, in that paper, we need to supplement the proof of Theorem 5.1 and to revise the proof of Theorem 5.2. Throughout this note, we use the same notation as in the paper cited in the heading. [ABSTRACT FROM PUBLISHER]
- Published
- 2009
- Full Text
- View/download PDF
4. ON THE FINE SPECTRUM OF THE GENERALIZED DIFFERENCE OPERATOR Δv OVER THE SEQUENCE SPACE C0.
- Author
-
Srivastava, P. D. and Kumar, Sudhanshu
- Subjects
- *
MATHEMATICAL analysis , *EQUATIONS , *REAL numbers , *MATHEMATICS , *NUMERICAL analysis - Abstract
The purpose of the paper is to determine fine spectrum of newly introduced operator Δν on the sequence space c0. The operator Δν on c0 is defined by Δνχ = (νnχn - νn-1χn-1)n=0∞ with χ-1 = 0, where ν = (νk) is either constant or strictly decreasing sequence of positive real numbers such that lim νk = L > 0 and sup νk ≤ 2L. In this paper, it is shown that spectrum (These equations cannot be represented into ASCII text), the point spectrum σp(Δν,c0) = ϕ if ν is a constant and σp(Δν,c0) = {νn} if ν is a strictly decreasing sequence. We have also obtained the results on continuous spectrum σc(Δν,c0), residual spectrum σr(Δν,c0) and fine spectrum of the operator Δν on c0. [ABSTRACT FROM AUTHOR]
- Published
- 2009
5. Error Estimates for a Variable Time-Step Discretization of a Phase Transition Model with Hyperbolic Momentum.
- Author
-
Segatti, Antonio
- Subjects
- *
NUMERICAL analysis , *EQUATIONS , *MATHEMATICAL optimization , *MATHEMATICAL analysis , *MATHEMATICS - Abstract
This paper deals with a fully implicit time discretization scheme with variable time-step for a nonlinear system modelling phase transition and mechanical deformations in shape memory alloys. The model is studied in the non-stationary case and accounts for local microscopic interactions between the phases introducing the gradients of the phase parameters. The resulting initial-boundary value problem has already been studied by the author who proved existence, uniqueness and continuous dependence on data for a suitable weak solution along some regularity results. A careful and detailed investigation of the variable time-step discretization is the goal of this paper. Thus, we deduce some estimates for the discretization error. These estimates depend only on data, impose no constraints between consecutive time-steps and show an optimal order of convergence. Finally, we prove another regularity result for the solution under stronger regularity assumptions on data. [ABSTRACT FROM AUTHOR]
- Published
- 2004
- Full Text
- View/download PDF
6. A TRUST REGION METHOD FOR SOLVING DISTRIBUTED PARAMETER IDENTIFICATION PROBLEMS.
- Author
-
Yan-fei Wang, L. F. and Ya-xiang Yuan
- Subjects
- *
EQUATIONS , *NUMERICAL analysis , *MATHEMATICAL analysis , *MATHEMATICAL statistics , *MATHEMATICS - Abstract
This paper is concerned with the ill-posed problems of identifying a parameter in an elliptic equation which appears in may applications in science and industry. Its solution is obtained by applying trust region method to a nonlinear least squares error problem. Trust region method has long been a popular method for well-posed problems. This paper indicates that it is also suitable for all-posed problems. Numerical experiment is given to compare the trust region method with the Tikhonov regularization method. It seems that the trust region method is more promising. [ABSTRACT FROM AUTHOR]
- Published
- 2003
7. CONVERGENCE OF SUBDIVISION SCHEMES ASSOCIATED WITH NONNEGATIVE MASKS.
- Author
-
Jia, Rong-Qing and Zhou, Ding-Xuan
- Subjects
- *
STOCHASTIC matrices , *EQUATIONS , *STOCHASTIC processes , *MATHEMATICAL analysis , *NUMERICAL analysis , *MATHEMATICS - Abstract
This paper is concerned with refinement equations of the type [This symbol cannot be presented in ASCII format] where f is the unknown function defined on the s-dimensional Euclidean space Rs, a is a finitely supported sequence on Zs, and M is an s × s dilation matrix with m := | det M|. The solution of a refinement equation can be obtained by using the subdivision scheme associated with the mask. In this paper we give a characterization for the convergence of the subdivision scheme when the mask is nonnegative. Our method is to relate the problem of convergence to m column-stochastic matrices induced by the mask. In this way, the convergence of the subdivision scheme can be determined in a finite number of steps by checking whether each finite product of those column-stochastic matrices has a positive row. As a consequence of our characterization, we show that the convergence of the subdivision scheme with a nonnegative mask depends only on the location of its positive coefficients. Several examples are provided to demonstrate the power and applicability of our approach. [ABSTRACT FROM AUTHOR]
- Published
- 1999
8. Design-Oriented Analysis of Circuits With Equality Constraints.
- Author
-
Vytyaz, Igor, Hanumolu, Pavan Kumar, Moon, Un-Ku, and Mayaram, Kartikeya
- Subjects
- *
ELECTRONIC circuit design , *LOGIC design , *NUMERICAL analysis , *MATHEMATICAL analysis , *FINITE differences , *MATHEMATICS - Abstract
This paper presents a design-oriented circuit analysis that is augmented with design constraints. This analysis computes the circuit response and also finds the values of circuit parameters (equal to the number of design specifications) that result in a specified circuit performance. An application of this approach is demonstrated for the periodic steady-state analysis with shooting and finite difference formulations. The new analysis with design equality constraints is several times faster than search-based techniques that employ conventional analysis methods. [ABSTRACT FROM PUBLISHER]
- Published
- 2011
- Full Text
- View/download PDF
9. Extended Well-Posedness of Quasiconvex Vector Optimization Problems.
- Author
-
Crespi, G., Papalia, M., and Rocca, M.
- Subjects
- *
MATHEMATICAL optimization , *EQUATIONS , *CONVEX functions , *NUMERICAL analysis , *MATHEMATICAL analysis , *MATHEMATICS - Abstract
The notion of extended-well-posedness has been introduced by Zolezzi for scalar minimization problems and has been further generalized to vector minimization problems by Huang. In this paper, we study the extended well-posedness properties of vector minimization problems in which the objective function is C-quasiconvex. To achieve this task, we first study some stability properties of such problems. [ABSTRACT FROM AUTHOR]
- Published
- 2009
- Full Text
- View/download PDF
10. A Linear Relaxation Technique for the Position Analysis of Multiloop Linkages.
- Author
-
Porta, Josep M., Ros, Lluís, and Thomas, Federico
- Subjects
- *
RELAXATION methods (Mathematics) , *NUMERICAL analysis , *EQUATIONS , *MATHEMATICS , *MATHEMATICAL analysis - Abstract
This paper presents a new method to isolate all configurations that a multiloop linkage can adopt. The problem is tackled by means of formulation and resolution techniques that fit particularly well together. The adopted formulation yields a system of simple equations (only containing linear, bilinear, and quadratic monomials, and trivial trigonometric terms for the helical pair only) whose structure is later exploited by a branch-and-prune method based on linear relaxations. The method is general, as it can be applied to linkages with single or multiple loops with arbitrary topology, involving lower pairs of any kind, and complete, as all possible solutions get accurately bounded, irrespective of whether the linkage is rigid or mobile. [ABSTRACT FROM AUTHOR]
- Published
- 2009
- Full Text
- View/download PDF
11. REHABILITATION OF THE LOWEST-ORDER RAVIART-THOMAS ELEMENT ON QUADRILATERAL GRIDS.
- Author
-
Bochev, Pavel B. and Ridzal, Denis
- Subjects
- *
STOCHASTIC convergence , *FINITE element method , *NUMERICAL analysis , *EQUATIONS , *GALERKIN methods , *MATHEMATICAL analysis , *MATHEMATICS - Abstract
A recent study [D. N. Arnold, D. Boffi, and R. S. Falk, SIAM J. Numer. Anal., 42 (2005), pp. 2429-2451] reveals that convergence of finite element methods using H(div , O)-compatible finite element spaces deteriorates on nonaffine quadrilateral grids. This phenomena is particularly troublesome for the lowest-order Raviart-Thomas elements, because it implies loss of convergence in some norms for finite element solutions of mixed and least-squares methods. In this paper we propose reformulation of finite element methods, based on the natural mimetic divergence operator [M. Shashkov, Conservative Finite Difference Methods on General Grids, CRC Press, Boca Raton, FL, 1996], which restores the order of convergence. Reformulations of mixed Galerkin and leastsquares methods for the Darcy equation illustrate our approach. We prove that reformulated methods converge optimally with respect to a norm involving the mimetic divergence operator. Furthermore, we prove that standard and reformulated versions of the mixed Galerkin method lead to identical linear systems, but the two versions of the least-squares method are veritably different. The surprising conclusion is that the degradation of convergence in the mixed method on nonaffine quadrilateral grids is superficial, and that the lowest-order Raviart-Thomas elements are safe to use in this method. However, the breakdown in the least-squares method is real, and there one should use our proposed reformulation. [ABSTRACT FROM AUTHOR]
- Published
- 2009
- Full Text
- View/download PDF
12. EXISTENCE OF SOLUTIONS FOR SYSTEMS OF LF-REFERRED AND HEREDITARY DIFFERENTIAL EQUATIONS.
- Author
-
VAN LE, U. T. and NGUYEN, LAN T. T.
- Subjects
- *
NUMERICAL solutions to differential equations , *NUMERICAL analysis , *EQUATIONS , *MATHEMATICAL analysis , *MATHEMATICS - Abstract
In this paper we investigate the existence of solutions of a system of self-referred and hereditary differential equations. The initial data are assumed to be lower semi-continuous. We also formulate some open questions. [ABSTRACT FROM AUTHOR]
- Published
- 2008
13. The Behavior of Positive Solutions of a Nonlinear Second-Order Difference Equation.
- Author
-
Stević, Stevo and Berenhaut, Kenneth S.
- Subjects
- *
MATHEMATICS , *MATHEMATICAL analysis , *NONLINEAR theories , *PERIODIC functions , *EQUATIONS , *NUMERICAL analysis - Abstract
This paper studies the boundedness, global asymptotic stability, and periodicity of positive solutions of the equation xn = f(xn-2)/g(xn-1), n ϵ ℕ0, where f, g ϵ C[(0,∞), (0,∞)]. It is shown that if f and g are nondecreasing, then for every solution of the equation the subsequences {x2n} and {x2n-1} are eventually monotone. For the case when f(x) = a + βx and g satisfies the conditions g(0) = 1, g is nondecreasing, and x/g(x) is increasing, we prove that every prime periodic solution of the equation has period equal to one or two. We also investigate the global periodicity of the equation, showing that if all solutions of the equation are periodic with period three, then f(x) = c1/x and g(x) = c2x, for some positive c1 and c2. [ABSTRACT FROM AUTHOR]
- Published
- 2008
- Full Text
- View/download PDF
14. Modified families of Newton, Halley and Chebyshev methods
- Author
-
Kanwar, V. and Tomar, S.K.
- Subjects
- *
NUMERICAL analysis , *MATHEMATICAL analysis , *MATHEMATICS , *EQUATIONS - Abstract
Abstract: This paper presents new families of Newton-type iterative methods (Newton, Halley and Chebyshev methods) for finding simple zero of univariate non-linear equation, permitting in the vicinity of the root. Newton-type iterative methods have well-known geometric interpretation and admit their geometric derivation from a parabola. These algorithms are comparable to the well-known powerful classical methods of Newton, Halley and Chebyshev respectively, and these can be seen as special cases of these families. The efficiency of the presented methods is demonstrated by numerical examples. [Copyright &y& Elsevier]
- Published
- 2007
- Full Text
- View/download PDF
15. Iterative methods with fourth-order convergence for nonlinear equations
- Author
-
Noor, Khalida Inayat and Noor, Muhammad Aslam
- Subjects
- *
MATHEMATICS , *NUMERICAL analysis , *MATHEMATICAL analysis , *EQUATIONS - Abstract
Abstract: In this paper, we suggest and analyze a new three-step iterative method for solving nonlinear equations involving only first derive of the function using a new decomposition technique which is due to Noor [M. Aslam Noor, Numerical Analysis and Optimization, Lecture Notes, COMSATS Institute of Information Technology, Islamabad, Pakistan, 2006; M. Aslam Noor, New iterative schemes for nonlinear equations, Appl. Math. Comput., in press] and Noor and Noor [M. Aslam Noor, K. Inayat Noor, Some iterative schemes for nonlinear equations, Appl. Math. Comput., in press]. We show that this new iterative method has fourth-order convergence. Several numerical examples are given to illustrate the efficiency and performance of the new method. [Copyright &y& Elsevier]
- Published
- 2007
- Full Text
- View/download PDF
16. A New Attack on the Filter Generator.
- Author
-
Rønjom, Sondre and Helleseth, Tor
- Subjects
- *
MATHEMATICS , *NONLINEAR systems , *SYSTEMS theory , *EQUATIONS , *ALGEBRA , *MATHEMATICAL analysis , *ALGORITHMS , *NUMERICAL analysis - Abstract
The filter generator is an important building block in many stream ciphers. The generator consists of a linear feedback shift register of length n that generates an m-sequence of period 2′ - 1 filtered through a Boolean function of degree d that combines bits from the shift register and creates an output bit zt at any time t. The previous best attacks aimed at reconstructing the initial state from an observed keystream, have essentially reduced the problem to solving a nonlinear system of D = (Multiple line equation(s) cannot be represented in ASCII text) (i) equations in n unknowns using techniques based on linear algebra. This attack needs about D bits of keystream and the system can be solved in complexity O (Dω), where ω can be taken to be Strassen's reduction exponent ω = log2 (7) ≈ 2.807. This paper describes a new algorithm that recovers the initial state of most filter generators after observing O(D) keystream bits with complexity O((D - n)/2) ≈ O(D), after a pre-computation with complexity O(D(log2 D)³). [ABSTRACT FROM AUTHOR]
- Published
- 2007
- Full Text
- View/download PDF
17. A STRENGTHENED CARLEMAN'S INEQUALITY.
- Author
-
Hu Yue
- Subjects
- *
EQUATIONS , *MATHEMATICAL formulas , *MATHEMATICS , *MATHEMATICAL analysis , *NUMERICAL analysis - Abstract
In this paper, it is proved that "Multiple line equation(s) cannot be represented in ASCII text." Where "Multiple line equation(s) cannot be represented in ASCII text." [ABSTRACT FROM AUTHOR]
- Published
- 2006
18. Error Estimate and the Geometric Corrector for the Upwind Finite Volume Method Applied to the Linear Advection Equation.
- Author
-
Bouche, Daniel, Ghidaglia, Jean-Michel, and Pascal, Frédéric
- Subjects
- *
FINITE volume method , *BOUNDARY element methods , *EQUATIONS , *NUMERICAL analysis , *MATHEMATICAL analysis , *MATHEMATICS - Abstract
This paper deals with the upwind finite volume method applied to the linear advection equation on a bounded domain and with natural boundary conditions. We introduce what we call the geometric corrector, which is a sequence associated with every finite volume mesh in $\mathbf{R}^{nd}$ and every nonvanishing vector $\mathbf{a}$ of $\mathbf{R}^{nd}$. First we show that if the continuous solution is regular enough and if the norm of this corrector is bounded by the mesh size, then an order one error estimate for the finite volume scheme occurs. Afterwards we prove that this norm is indeed bounded by the mesh size in several cases, including the one where an arbitrary coarse conformal triangular mesh is uniformly refined in two dimensions. Computing numerically exactly this corrector allows us to state that this result might be extended under conditions to more general cases, such as the one with independent refined meshes. [ABSTRACT FROM AUTHOR]
- Published
- 2005
- Full Text
- View/download PDF
19. Convergence of a Numerical Scheme for Stratigraphic Modeling.
- Author
-
Eymard, R., Gallouët, T., Gervais, V., and Masson, R.
- Subjects
- *
EQUATIONS , *NUMERICAL solutions to equations , *NUMERICAL analysis , *MATHEMATICAL analysis , *STOCHASTIC convergence , *MATHEMATICS - Abstract
In this paper, we consider a multilithology diffusion model used in the field of stratigraphic basin simulations to simulate large scale depositional transport processes of sediments described as a mixture of L lithologies. This model is a simplified one for which the surficial fluxes are proportional to the slope of the topography and to a lithology fraction with unitary diffusion coefficients. The main variables of the system are the sediment thickness h, the L surface concentrations cis in lithology i of the sediments at the top of the basin, and the L concentrations ci in lithology i in the sediments inside the basin. For this simplified model, the sediment thickness decouples from the other unknowns and satisfies a linear parabolic equation. The remaining equations account for the mass conservation of the lithologies, and couple, for each lithology, a first order linear equation for cis with a linear advection equation for ci for which cis appears as an input boundary condition. For this coupled system, a weak formulation is introduced. The system is discretized by an implicit time integration and a cell centered finite volume method. This numerical scheme is shown to satisfy stability estimates and to converge, up to a subsequence, to a weak solution of the problem. [ABSTRACT FROM AUTHOR]
- Published
- 2005
- Full Text
- View/download PDF
20. A conservative flux for the continuous Galerkin method based on discontinuous enrichment.
- Author
-
Larson, M.G. and Niklasson, A.J.
- Subjects
- *
NUMERICAL analysis , *GALERKIN methods , *EQUATIONS , *ALGORITHMS , *MATHEMATICS , *MATHEMATICAL analysis - Abstract
In this paper we develop techniques for computing elementwise conservative approximations of the flux on element boundaries for the continuous Galerkin method. The technique is based on computing a correction of the average normal flux on an edge or face. The correction is a jump in a piecewise constant or linear function. We derive a basic algorithm which is based on solving a global system of equations and a parallel algorithm based on solving local problems on stars. The methods work on meshes with different element types and hanging nodes. We prove existence, uniqueness, and optimal order error estimates. Lastly, we illustrate our results by a few numerical examples. [ABSTRACT FROM AUTHOR]
- Published
- 2004
- Full Text
- View/download PDF
21. CLASSIFICATION OF LINEAR PERIODIC DIFFERENCE EQUATIONS UNDER PERIODIC OR KINEMATIC SIMILARITY.
- Author
-
Gohberg, I., Kaashoek, M. A., and Kos, J.
- Subjects
- *
EQUATIONS , *KINEMATICS , *DIFFERENTIAL equations , *LINEAR operators , *MATHEMATICAL analysis , *NUMERICAL analysis , *MATHEMATICS - Abstract
In this paper linear periodic systems of difference equations are classified with respect to periodic similarity and kinematic similarity. Complete sets of invariants of periodic difference equations relative to such similarity transformations are given, and corresponding canonical forms are described. Also the irreducible periodic difference equations, i.e., those that cannot be reduced by such similarities to a nontrivial direct sum, are identified. [ABSTRACT FROM AUTHOR]
- Published
- 1999
22. TRANSIENT PLATE BENDING ANALYSIS BY HYBRID TREFFTZ ELEMENT APPROACH.
- Author
-
Qing-Hua Qin
- Subjects
- *
NUMERICAL analysis , *MATHEMATICAL analysis , *BENDING (Metalwork) , *EQUATIONS , *MATHEMATICS - Abstract
The paper presents a hybrid Trefftz (HT) element approach for the numerical solution of transient plate bending problems. In the proposed method, the dynamic plate equation is first discretized with respect to time and then the resulting set of elliptic equations is solved by the corresponding time independent hybrid Trefftz element approach. Two examples are considered to assess the effectiveness of the numerical method. [ABSTRACT FROM AUTHOR]
- Published
- 1996
- Full Text
- View/download PDF
23. An extension of the Derrida–Lebowitz–Speer–Spohn equation.
- Author
-
Charles Bordenave, Pierre Germain, and Thomas Trogdon
- Subjects
- *
EQUATIONS , *NUMERICAL analysis , *ALGEBRA , *MATHEMATICS , *MATHEMATICAL analysis - Abstract
We show how the derivation of the Derrida–Lebowitz–Speer–Spohn equation can be prolonged to obtain a new equation, generalizing the models obtained in the paper by these authors. We then investigate its properties from both an analytical and numerical perspective. Specifically, a numerical method is presented to approximate solutions of the prolonged equation. Using this method, we investigate the relationship between the solutions of the prolonged equation and the Tracy–Widom GOE distribution. [ABSTRACT FROM AUTHOR]
- Published
- 2015
- Full Text
- View/download PDF
24. Comments and Corrections.
- Author
-
Yan Wang and Rongke Liu
- Subjects
- *
EQUATIONS , *MATHEMATICS , *ERROR analysis in mathematics , *MATHEMATICAL analysis , *NUMERICAL analysis - Abstract
In this correspondence, we point out an error in equation (4) in the above paper. We also correct equation (4) by a detailed mathematical deduction. [ABSTRACT FROM AUTHOR]
- Published
- 2010
- Full Text
- View/download PDF
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.