Search

In this paper, we obtain some new Lyapunov-type inequalities for a class of even-order linear differential equations, the results are new and generalize and improve some early results in this field. [ABSTRACT FROM AUTHOR]

This paper discusses the eigenvalue problem for the real symmetric matrix, especially the determination of the largest eigenvalue. The largest eigenvalue is the maximum extremum of the objective function called the Rayleigh quotient and can be determined by the steepest descent method. It is known, however, that the steepest descent method suffers from slow convergence because it converges linearly. Especially, when the largest and the nest largest eigenvalues have very close values, the convergence is particularly slow. This paper analyzes this situation and shows that the convergence can be accelerated by combining the steepest descent method with a technique called shaking. Finally, it is demonstrated by a numerical example that the convergence is accelerated drastically by the proposed technique. [ABSTRACT FROM AUTHOR]

The paper investigates the inclusion intervals of matrix singular values. By employing the digraph of a matrix, some new inclusion intervals of matrix singular values are presented. These intervals are based mainly on the use of positive scale vectors and their intersections. Theoretic analysis and numerical examples show that these results improve and generalize some known results of Li et al. (Numer. Linear Algebra Appl. 2007; 14(2):115–128) and Kolotilina (J. Math. Sci. 2006; 137(3):4794–4800). Copyright © 2009 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

The method proposed by J.C. Houbolt in 1950 is one of the pioneering methods of time integration. Nevertheless, especially due to its multi-step fashion and not having a well-defined starting procedure, the method has not met considerable acceptance. The conversion of the Houbolt method to a one-step method is reported in the literature. However, the resulting method still lacks an appropriate starting procedure for all practical cases. In this paper, a parameter-less unified starting procedure is proposed for time integration with the Houbolt method. Copyright © 2006 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

A Markov property associates a set of conditional independencies to a graph. Two alternative Markov properties are available for chain graphs (CGs), the Lauritzen–Wermuth–Frydenberg (LWF) and the Andersson–Madigan– Perlman (AMP) Markov properties, which are different in general but coincide for the subclass ofCGs with no flags. Markov equivalence induces a partition of the class of CGs into equivalence classes and every equivalence class contains a, possibly empty, subclass of CGs with no flags itself containing a, possibly empty, subclass of directed acyclic graphs (DAGs). LWF-Markov equivalence classes of CGs can be naturally characterized by means of the so-calledlargest CGs, whereas a graphical characterization of equivalence classes of DAGs is provided by theessential graphs. In this paper, we show the existence of largest CGs with no flags that provide a natural characterization of equivalence classes of CGs of this kind, with respect to both the LWF- and the AMP-Markov properties. We propose a procedure for the construction of the largest CGs, the largest CGs with no flags and the essential graphs, thereby providing a unified approach to the problem. As by-products we obtain a characterization of graphs that are largest CGs with no flags and an alternative characterization of graphs which are largest CGs. Furthermore, a known characterization of the essential graphs is shown to be a special case of our more general framework. The three graphical characterizations have a common structure: they use two versions of a locally verifiable graphical rule. Moreover, in case of DAGs, an immediate comparison of three characterizing graphs is possible. [ABSTRACT FROM AUTHOR]

We consider strategies to construct optimal order two- and multilevel hierarchical preconditioners for linear systems as arising from the finite element discretization of self-adjoint second order elliptic problems using non-conforming Crouzeix–Raviart linear elements. In this paper we utilize the hierarchical decompositions, derived in a previous work by the same authors (Numerical Linear Algebra with Applications 2004; 11:309–326) and provide a further analysis of these decompositions in order to assure robustness with respect to anisotropy. Finally, we show how to construct both multiplicative and additive versions of the algebraic multilevel iteration preconditioners and show robustness and optimal order convergence estimates. Copyright © 2005 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

There exists a set U in the plane, such that elements of U correspond to minimal stable solutions of a two-parameter elliptic system. For points on the boundary ϒ of U, there exist weak solutions to the elliptic system. The paper studies the properties of the curve ϒ. 2000 Mathematics Subject Classification 35J55, 35B05, 35K50, 35K55. [ABSTRACT FROM PUBLISHER]

In this paper we discuss some linear algebra issues concerning the implementation of blended implicit methods (J. Comput. Appl. Math. 2000; 116:41–62, Appl. Numer. Math. 2002; 42:29–45, J. Comput. Appl. Math. 2004; 164–165:145–158, In Recent Trends in Numerical Analysis, Trigiante D (ed.), Nova Science Publication Inc.: New York, 2001; 81–105) for the numerical solution of ODEs. In particular, we describe the strategies, used in the numerical code BiM (J. Comput. Appl. Math. 2004; 164–165:145–158), for deciding whether re-evaluating the Jacobian and/or the factorization involved in the non-linear splitting for solving the discrete problem. Copyright © 2004 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

In this paper, some identities in laws involving ladder processes for random walks and Lvy processes are extended and unified. [ABSTRACT FROM AUTHOR]

This paper describes and compares several effective methods for the numerical solution of one-dimensional Stefan problems. It is not intended to be an exhaustive review but is restricted to a range of problems and geometries including melting in the half-plane, outward cylindrical solidification and outward spherical solidification. From the limited comparison of numerical results obtained, some helpful comments can be made which may prove valuable in the future use of these methods. Copyright © 2004 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

There are two versions of the Proper Iteration Lemma. The stronger (but less well-known) version can be used to give simpler proofs of iteration theorems (e.g., [7, Lemma 24] versus [9, Theorem IX.4.7]). In this paper we give another demonstration of the fecundity of the stronger version by giving a short proof of Shelah's theorem on the preservation of the ωω-bounding property. (© 2003 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim) [ABSTRACT FROM AUTHOR]

In this paper we define the polyadic Pavelka algebras as algebraic structures for Rational Pavelka predicate calculus (RPL∀). We prove two representation theorems which are the algebraic counterpart of the completness theorem for RPL∀. [ABSTRACT FROM AUTHOR]

In [4] the authors studied the residue field of a model M of IΔ0 + Ω1 for the principal ideal generated by a prime p. One of the main results is that M/ has a unique extension of each finite degree. In this paper we are interested in understanding the structure of any quotient field of M, i.e. we will study the quotient M/I for I a maximal ideal of M. We prove that any quotient field of M satisfies the property of having a unique extension of each finite degree. We will use some of Cherlin's ideas from [3], where he studies the ideal theory of non standard algebraic integers. [ABSTRACT FROM AUTHOR]

This paper suggests a new method, called AINV-A, for constructing sparse approximate inverse preconditioners for positive-definite matrices, which can be regarded as a modification of the AINV method proposed by Benzi and Túma. Numerical results on SPD test matrices coming from different applications demonstrate the robustness of the AINV-A method and its superiority to the original AINV approach. Copyright © 2001 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

This paper discusses error spectrum shaping for 2D state-space digital filters. In order to reduce cost by reducing the total number of parameters, a method of analytic design is proposed in which the error feedback coefficient is specified by a diagonal matrix. The proposed algorithm has the feature that the optimal error feedback coefficient can be designed analytically in closed form by minimizing a quadratic form. The validity of the proposed algorithm is demonstrated with a numerical example. The noise reduction effect where the subdecimal part of the optimal coefficient is rounded by the power of 2 is also demonstrated. © 1998 Scripta Technica. Electron Comm Jpn Pt 3, 81(1): 79–90, 1998 [ABSTRACT FROM AUTHOR]

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]

In this paper a new method has been presented to determine the optimum number of knots for cubic splines. The knot-finding process is based on the numerical integration of the input curve. The number and the location of the knots is determined automatically. The method has been applied to a test case and the performance has been compared with two other existing methods. It is shown that fewer knots are retained for the portions of the curve having small curvature whereas a larger number of knots is retained for highly curved portions. The computer time required by our method depends only upon the number of points in the input curve and does not depend upon the shape of the curve or the desired accuracy. [ABSTRACT FROM AUTHOR]

Although unconditionally stable (US), the accuracy of ADI-FDTD is not so high as that of conventional FDTD. In this paper, a high-order US-FDTD based on the weighted finite-difference method is presented. A strict analysis of stability shows that it is unconditionally stable. And, more importantly, its numerical-dispersion performance is superior to that of ADI-FDTD. © 2005 Wiley Periodicals, Inc. Microwave Opt Technol Lett 45: 142–144, 2005; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/mop.20749 [ABSTRACT FROM AUTHOR]

A finite-element implementation for the analysis of propagation constants and fields in a guiding structure is presented in this paper. The solution explicitly takes into account the field divergence on the edges of the internal wedges by exploiting substitutive divergent bases. © 2005 Wiley Periodicals, Inc. Microwave Opt Technol Lett 44: 327–328, 2005; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/mop.20624 [ABSTRACT FROM AUTHOR]