نتایج جستجو برای: schmidt orthogonalization

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

2015
Bharat Kumar Saxena

Introduction: Wind speed probability at a site has to be modeled for evaluating the energy generation potential of a wind farm. Analytical computation of wind turbine capacity factor at the planning stage of a wind farm is very crucial. Thus, the comparison of Weibull parameters estimation methods and computation of wind turbine capacity factor are the focus of this paper. Case description: Sod...

2008
Florent Jangal Florent Mandereau

Maritime surveillance of the Exclusive Economic Zone (EEZ) is a present military and civilian challenge. The High Frequency Surface Wave Radar, as its coverage range is not limited by the radio horizon, is well-suited to fulfil this task. HFSWRs are based on the ability of HF waves (3 MHz to 30 MHz) to propagate along the earth curvature: it is possible to detect targets up to few hundred kilom...

2008
IZUMI KUBO SUAT NAMLI

We characterize the class of probability measures for which the multiplicative renormalization method can be applied for the function h(x) = 1 √ 1−x to obtain orthogonal polynomials. It turns out that this class consists of only uniform probability measures on intervals and probability measures being supported by one or two points. 1. Multiplicative Renormalization Method Let μ be a probability...

2002
Ilir F. Progri William R. Michalson Matthew C. Bromberg

Previously, we have discussed a recursive solution to the vector normal equation utilizing the recursive Cholesky and Modified Gram-Schmidt Orthogonalization (MGSO) algorithms. Previously, we have also discussed a blind adaptive approach for detection and extraction of signals of interest in the presence of noise and interference without relying on preamble or training sequences. The heart of t...

2015
Froilán Dopico Frank Uhlig

Over any field F every square matrix A can be factored into the product of two symmetric matrices as A = S1 ·S2 with Si = S i ∈ F and either factor can be chosen nonsingular, as was discovered by Frobenius in 1910. Frobenius’ symmetric matrix factorization has been lying almost dormant for a century. The first successful method for computing matrix symmetrizers, i.e., symmetric matrices S such ...

Journal: :IJMMME 2011
Anirban Mitra Prasanta Sahoo Kashinath Saha

Large amplitude forced vibration behaviour of stiffened plates under harmonic excitation is studied numerically incorporating the effect of geometric non-linearity. The forced vibration analysis is carried out in an indirect way in which the dynamic system is assumed to satisfy the force equilibrium condition at peak excitation amplitude. Large amplitude free vibration analysis of the same syst...

2011
Manzur Murshed Manoranjan Paul Shuqun Zhang Mohammad A. Karim Mohammad Nurul Huda

—— This paper describes an evaluation of Inhibition/Enhancement (In/En) network for robust automatic speech recognition (ASR). In distinctive phonetic features (DPFs) based speech recognition using neural network, In/En network is needed to discriminate whether the DPFs dynamic patterns of trajectories are convex or concave. The network is used to achieve categorical DPFs movement by enhancing ...

Journal: :Journal of Approximation Theory 2009
Ruymán Cruz-Barroso Steven Delvaux

Let there be given a probability measure μ on the unit circle T of the complex plane and consider the inner product induced by μ. In this paper we consider the problem of orthogonalizing a sequence of monomials {zk}k, for a certain order of the rk ∈ Z, by means of the Gram-Schmidt orthogonalization process. This leads to a basis of orthonormal Laurent polynomials {ψk}k. We show that the matrix ...

Journal: :IACR Cryptology ePrint Archive 2016
Thomas Espitau Antoine Joux

Lattice reduction is fundamental in computational number theory and in computer science, especially in cryptography. The celebrated Lenstra–Lenstra–Lovász reduction algorithm (called LLL or L) has been improved in many ways through the past decades and remains one of the central tool for reducing lattice basis. In particular, its floating-point variants — where the long-integer arithmetic requi...

Journal: :SIAM J. Comput. 2009
Phong Q. Nguyen Damien Stehlé

The Lenstra–Lenstra–Lovász lattice basis reduction algorithm (called LLL or L3) is a fundamental tool in computational number theory and theoretical computer science, which can be viewed as an efficient algorithmic version of Hermite’s inequality on Hermite’s constant. Given an integer d-dimensional lattice basis with vectors of Euclidean norm less than B in an ndimensional space, the L3 algori...

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

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