نتایج جستجو برای: recursive method

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

1998
J. Grabowski G. Marmo

We show that Nambu-Poisson and Nambu-Jacobi brackets can be defined inductively: an n-bracket, n > 2, is Nambu-Poisson (resp. Nambu-Jacobi) if and only if fixing an argument we get an (n − 1)-Nambu-Poisson (resp. Nambu-Jacobi) bracket. As a by-product we get relatively simple proofs of Darboux-type theorems for these structures.

Journal: :Int. J. Math. Mathematical Sciences 2004
Fred Brackx Nele De Schepper Frank Sommen

A new method for constructing Clifford algebra-valued orthogonal polynomials in the open unit ball of Euclidean space is presented. In earlier research, we only dealt with scalar-valued weight functions. Now the class of weight functions involved is enlarged to encompass Clifford algebra-valued functions. The method consists in transforming the orthogonality relation on the open unit ball into ...

2003
Ralph Neininger Ludger Rüschendorf

In the first part of this paper we give an introduction to the contraction method for the analysis of additive recursive sequences of divide and conquer type. Recently some general limit theorems have been obtained by this method based on a general transfer theorem. This allows to conclude from the recursive structure and the asymptotics of first moment(s) the limiting distribution. In the seco...

Journal: :The Transactions of The Korean Institute of Electrical Engineers 2011

1999
J. Grabowski G. Marmo

We show that Nambu-Poisson and Nambu-Jacobi brackets can be defined inductively: an n-bracket, n > 2, is Nambu-Poisson (resp. Nambu-Jacobi) if and only if fixing an argument we get an (n − 1)-Nambu-Poisson (resp. Nambu-Jacobi) bracket. As a by-product we get relatively simple proofs of Darboux-type theorems for these structures.

1998
J. Grabowski G. Marmo

We show that Nambu-Poisson and Nambu-Jacobi brackets can be defined inductively: an n-bracket, n > 2, is Nambu-Poisson (resp. Nambu-Jacobi) if and only if fixing an argument we get an (n − 1)-Nambu-Poisson (resp. Nambu-Jacobi) bracket. As a by-product we get relatively simple proofs of Darboux-type theorems for these structures.

2014
Syariful S. Shamsudin XiaoQi Chen

The ability to model the time varying dynamics of an unmanned rotorcraft is an important aspect in the development of adaptive flight controller. This paper presents a recursive Gauss-Newton based training algorithm to model the attitude dynamics of a small scale rotorcraft based unmanned aerial system using the neural network (NN) modelling approach. It focuses on selection of optimised networ...

Journal: :IJISTA 2014
Syariful S. Shamsudin Xiaoqi Chen

The ability to model the time varying dynamics of an unmanned rotorcraft is an important aspect in the development of adaptive flight controller. This paper presents a recursive Gauss-Newton based training algorithm to model the attitude dynamics of a small scale rotorcraft based unmanned aerial system using the neural network (NN) modelling approach. It focuses on selection of optimised networ...

2017
Cameron Musco Christopher Musco

We give the first algorithm for kernel Nyström approximation that runs in linear time in the number of training points and is provably accurate for all kernel matrices, without dependence on regularity or incoherence conditions. The algorithm projects the kernel onto a set of s landmark points sampled by their ridge leverage scores, requiring just O(ns) kernel evaluations and O(ns) additional r...

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

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