نتایج جستجو برای: jacobi iterativemethod

تعداد نتایج: 9584  

2008
Young Joon Ahn YOUNG JOON AHN

In this paper, we present the constrained Jacobi polynomial which is equal to the constrained Chebyshev polynomial up to constant multiplication. For degree n = 4, 5, we find the constrained Jacobi polynomial, and for n ≥ 6, we present the normalized constrained Jacobi polynomial which is similar to the constrained Chebyshev polynomial.

2008
OLAV K. RICHTER

We consider congruences and filtrations of Jacobi forms. More specifically, we extend Tate’s theory of theta cycles to Jacobi forms, which allows us to prove a criterion for an analog of Atkin’s U-operator applied to a Jacobi form to be nonzero modulo a prime.

Journal: :Int. J. Math. Mathematical Sciences 2006
Min Ho Lee

Jacobi-like forms of one variable are formal power series with holomorphic coefficients satisfying a certain transformation formula with respect to the action of a discrete subgroup Γ of SL(2,R), and they are related to modular forms for Γ, which of course play a major role in number theory. Indeed, by using this transformation formula, it can be shown that that there is a one-to-one correspond...

Journal: :Journal of the Royal Asiatic Society of Great Britain & Ireland 1938

Journal: :caspian journal of mathematical sciences 2014
m. bayat z. khatami

‎in this paper‎, ‎an efficient algorithm for solving a system of linear‎ ‎equations based on the homotopy analysis method is presented‎. ‎the‎ ‎proposed method is compared with the classical jacobi iterative‎ ‎method‎, ‎and the convergence analysis is discussed‎. ‎finally‎, ‎two‎ ‎numerical examples are presented to show the effectiveness of the‎ ‎proposed method.‎

2013
Huabin Ruan Xiaomeng Huang Haohuan Fu Guangwen Yang

The classical Jacobi method is widely used for solving linear systems. This method is considerably timeconsuming to compute millions upon millions of linear equations. In this study, we design a novel FPGA-based Jacobi Solver. The kernel of the Jacobi Solver is a pipeline-friendly iteration algorithm which can eliminate the data dependence between iteration steps. This algorithm is suitable for...

Journal: :IACR Cryptology ePrint Archive 2010
Dustin Moody

In this paper we find division polynomials for Huff curves, Jacobi quartics, and Jacobi intersections. These curves are alternate models for elliptic curves to the more common Weierstrass curve. Division polynomials for Weierstrass curves are well known, and the division polynomials we find are analogues for these alternate models. Using the division polynomials, we show recursive formulas for ...

Journal: :IACR Cryptology ePrint Archive 2010
Hong Wang Kunpeng Wang Lijun Zhang Bao Li

This paper proposes explicit formulae for the addition step and doubling step in Miller’s algorithm to compute Tate pairing on Jacobi quartic curves. We present a geometric interpretation of the group law on Jacobi quartic curves, which leads to formulae for Miller’s algorithm. The doubling step formula is competitive with that for Weierstrass curves and Edwards curves. Moreover, by carefully c...

2011
TOMOKI OHSAWA

We develop Hamilton–Jacobi theory for Chaplygin systems, a certain class of nonholonomic mechanical systems with symmetries, using a technique called Hamiltonization, which transforms nonholonomic systems into Hamiltonian systems. We give a geometric account of the Hamiltonization, identify necessary and sufficient conditions for Hamiltonization, and apply the conventional Hamilton–Jacobi theor...

2008
DONALD YAU

A Hom-Lie algebra is a triple (L, [−,−], α), where α is a linear self-map, in which the skew-symmetric bracket satisfies an α-twisted variant of the Jacobi identity, called the Hom-Jacobi identity. When α is the identity map, the Hom-Jacobi identity reduces to the usual Jacobi identity, and L is a Lie algebra. Hom-Lie algebras and related algebras were introduced in [1] to construct deformation...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید