On a new generalization of Fibonacci quaternions

In this paper, we present a new generalization of the Fibonacci quaternions that are emerged as a generalization of the best known quaternions in the literature, such as classical Fibonacci quaternions, Pell quaternions, k -Fibonacci quaternions. We give the generating function and the Binet formula for these quaternions. By using the Binet formula, we obtain some well-known results. Also, we correct some results in [3] and [4] which have been overlooked that the quaternion multiplication is non commutative.     

On the quadratic convergence of the Jabobi method for normal matrices

It has recently been proved that the Jacobi method for computing eigenvalues and eigenvectors of real symmetric matrices after a certain stage in the process converges quadratically ([3], [4]). The purpose of this paper is to prove that this also applies to the generalization of the Jacobi method for general normal matrices due to Goldstine and Horwitz [2]. We restrict ourselves to the special row cyclic method of enumerating pivot elements, but it is believed that also other kinds of enumeration will give similar results. The proof consists of two parts; in the first part we show that under certain conditions the pivot element chosen is nearly annihilated, and in the second part we use this to study what happens with the off-diagonal elements after a whole sweep has been performed.     

Meet decompositions in complete lattices

In the present paper we shall study infinite meet decompositions of an element of a complete lattice. We give here a generalization of some results of papers [2] and [3].     

Convergence of a preconditioned iterative method for H-matrices

In this paper, we consider a preconditioned iterative method for solving the linear system Ax = b, which is a generalization of a method proposed in Kotakemori et al. [3] and prove its convergence for the case when A is an H-matrix.     

一类域上的线性变换环的群结构

In this paper, we introduce a practical method for obtaining the structure of the group of units for the ring of linear transformations of a vector space over an arbitrary field, and we give a further generalization of the result in [3].     

Approximation by a Generalized Szasz Type Operator

Using a method given by Jakimovski–Leviatan, we introduce a Favard-Szasz type operator. We study the properties of approximation for a function in the space of functions having an exponential growth at infinity. This operator is a generalization of an operator introduced by M. Lesniewicz and L. Rempulska [3].     

On the interconnection structures of discretized port Hamiltonian systems

For numerical simulation and control design purposes, a mixed-finite element method [3] preserving the port Hamiltonian structure of the system has been developed [2]. This method was successfully applied for 1D systems. In this paper, we shall suggest some generalization of this result to higher dimensional spatial domain (3D) using Whitney forms as Galerkin base. The discretization procedure is illustrated on Maxwell's equations. (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

A new method for computing polynomial greates common divisors and polynomial remainder sequences

Summary A new method is presented for the computation of a greatest common divisor (gcd) of two polynomials, along with their polynomial remainder sequence (prs). This method is based on our generalization of a theorem by Van Vleck [12] and uniformly treats both normal and abnormal prs's, making use of Bareiss's [3] integer-preserving transformation algorithm for Gaussian elimination. Moreover, for the polynomials of the prs's, this method provides the smallest coefficients that can be expected without coefficient ged computations (as in Bareiss [3]) and it clearly demonstrates the divisibility properties; hence, it combines the best of both the reduced and the subresultant prs algorithms.This paper is affectionately dedicated to the memory of my father     

Centralizers of Iwahori-Hecke Algebras II: The General Case

This paper is a sequel to [4]. We establish the minimal basis theory for the centralizers of parabolic subalgebras of Iwahori-Hecke algebras associated to finite Coxeter groups of any type, generalizing the approach introduced in [3] from centres to the centralizer case. As a pro-requisite, we prove a reducibility property in the twisted J-conjugacy classes in finite Coxeter groups, which is a generalization of results in [7] and [4].2000 Mathematics Subject Classification: 20C08, 20F55     

On the structure of regular pairwise balanced designs

In this paper we obtain determinantal conditions necessary for the existence of (r,λ)-designs. The work is based on a paper of Connor [2]. In [3] Deza establishes an inequality which must be satisfied by the column vectors of an equidistant code; or, equivalently, the block sizes in an (r,λ)-design. We obtain a generalization of this inequality.     

On the solutions of a second order nonlinear system with almost periodic forcing

A second order almost periodic perturbed nonlinear system with small parameter is discussed in this paper. Based on some analytical techniques and the method of averaging, some sufficient conditions are obtained for existence of one almost periodic solution. Also some suitable conditions are given for existence of two almost periodic solutions. The obtained new results generalized the known results in Seifert [1], [3] and He [2], [4]. Finally, some applications are presented to illustrate that our results are a good generalization of the known results.     

On Markovian decision programming with recursive reward functions

In this paper, the infinite horizon Markovian decision programming with recursive reward functions is discussed. We show that Bellman's optimal principle is applicable for our model. Then, a sufficient and necessary condition for a policy to be optimal is given. For the stationary case, an iteration algorithm for finding a stationary optimal policy is designed. The algorithm is a generalization of Howard's [7] and Iwamoto's [3] algorithms.This research was supported by the National Natural Science Foundation of China.     

Ito型随机积分方程依参数收敛性定理

本文在一定假设条件下，给出了一类　型随机积分方程依参数收敛性问题的一个定理，推广了［２］［３］的相应结果。     

Linear congruence relations for 2-adic L-series at integers

In the paper we find a further generalization of congruences of the K. Hardy and K. S. Williams [5] type which seems to be a full generalization of congruences of G. Gras [4]. Moreover we extend results of [5], [7], [8], [9] and in part of [6]. We apply ideas and methods of [2], [7] and [9].     

An iterative thresholding algorithm for linear inverse problems with multi-constraints and its applications

In this paper, we will present a generalization for a minimization problem from I. Daubechies, M. Defrise, and C. DeMol (2004) [3]. This generalization is useful for solving many practical problems in which more than one constraint are involved. In this regard, we will conclude the findings of many papers (most of which are on image processing) from this generalization. It is hoped that the approach proposed in this paper will be a suitable reference for some applied works where multi-frames, multi-wavelets, or multi-constraints are present in linear inverse problems.     

Schensted Algorithms for Dual Graded Graphs

This paper is a sequel to [3]. We keep the notation and terminology and extend the numbering of sections, propositions, and formulae of [3].The main result of this paper is a generalization of the Robinson-Schensted correspondence to the class of dual graded graphs introduced in [3], This class extends the class of Y-graphs, or differential posets [22], for which a generalized Schensted correspondence was constructed earlier in [2].The main construction leads to unified bijective proofs of various identities related to path counting, including those obtained in [3]. It is also applied to permutation enumeration, including rook placements on Ferrers boards and enumeration of involutions.As particular cases of the general construction, we re-derive the classical algorithm of Robinson, Schensted, and Knuth [19, 12], the Sagan-Stanley [18], Sagan-Worley [16, 29] and Haiman's [11] algorithms and the author's algorithm for the Young-Fibonacci graph [2]. Some new applications are suggested.The rim hook correspondence of Stanton and White [23] and Viennot's bijection [28] are also special cases of the general construction of this paper.In [5], the results of this paper and the previous paper [3] were presented in a form of extended abstract.     

A Theorem on Infinitesimal I-isometry of Surfaces Immersed in a Space with Constant Curvature

1.IntroductionTheproblemsofinfinitesimalrigidityandisometricdeformationhavebeenextensivelyin-vestigatedforsurfacesinthreedimensionalEuclideanspaceE'.See,forexample,A.SvecL1]'E.Kann[2j,ZhouJiazu[3Jandthepapers[4j,[5J,[6JbyYangWenmao3also,KobayashiandNomizu[7].ThefirstauthorandZhangGaoyonggeneralizedthetheoryofinfinitesimali-sometriesofsurfacesinE3tothehypersurfacesimmersedinaspaceofconstantcurvature[8j.K.Tenenblat[9]andR.A.GoldsteinandP.J.Ryan[1o]studiedtheinfinitesimalI-isometryfors…     

Amalgamation functors and boundary properties in simple theories

This paper continues the study of generalized amalgamation properties begun in [1], [2], [3], [5] and [6]. Part of the paper provides a finer analysis of the groupoids that arise from failure of 3-uniqueness in a stable theory. We show that such groupoids must be abelian and we link the binding group of the groupoids to a certain automorphism group of the monster model, showing that the group must be abelian as well. We also study connections between n-existence and n-uniqueness properties for various “dimensions” n in the wider context of simple theories. We introduce a family of weaker existence and uniqueness properties. Many of these properties did appear in the literature before; we give a category-theoretic formulation and study them systematically. Finally, we give examples of first-order simple unstable theories showing, in particular, that there is no straightforward generalization of the groupoid construction in an unstable context.     

Improving a method for computing non-dominant solutions of certain second-order recurrence relations of Poincaré-type

Summary In this paper we present a method of convergence acceleration for the calculation of non-dominant solutions of second-order linear recurrence relations for which the coefficients satisfy certain asymptotic conditions. It represents an improvement of the method recently proposed by Jacobsen and Waadeland [3, 4] for limit periodic continued fractions. For continued fractions the method corresponds to a repeated application of the Bauer-Muir transformation. Some examples and a generalization to non-homogeneous recurrence relations are given.     

Viscosity approximation methods for resolvents of accretive operators in Banach spaces

In this paper, we first prove a strong convergence theorem for resolvents of accretive operators in a Banach space by the viscosity approximation method, which is a generalization of the results of Reich [J. Math. Anal. Appl. 75 (1980), 287–292], and Takahashi and Ueda [J. Math. Anal. Appl. 104 (1984), 546–553]. Further using this result, we consider the proximal point algorithm in a Banach space by the viscosity approximation method, and obtain a strong convergence theorem which is a generalization of the result of Kamimura and Takahashi [Set-Valued Anal. 8 (2000), 361–374]. Dedicated to the memory of Jean Leray