Search results for "Algorithm"
showing 10 items of 4887 documents
Continuous numerical solutions of coupled mixed partial differential systems using Fer's factorization
1999
In this paper continuous numerical solutions expressed in terms of matrix exponentials are constructed to approximate time-dependent systems of the type ut A(t)uxx B(t)u=0; 0 0, u(0;t)=u(p;t)=0; u(x;0)=f(x);06 x6p. After truncation of an exact series solution, the numerical solution is constructed using Fer’s factorization. Given >0 and t0;t1; with 0<t0<t1 and D(t0;t1)=f(x;t); 06x6p; t06t6t1g the error of the approximated solution with respect to the exact series solution is less than uniformly in D(t0;t1). An algorithm is also included. c 1999 Elsevier Science B.V. All rights reserved. AMS classication: 65M15, 34A50, 35C10, 35A50
Qualitative analysis of matrix splitting methods
2001
Abstract Qualitative properties of matrix splitting methods for linear systems with tridiagonal and block tridiagonal Stieltjes-Toeplitz matrices are studied. Two particular splittings, the so-called symmetric tridiagonal splittings and the bidiagonal splittings, are considered, and conditions for qualitative properties like nonnegativity and shape preservation are shown for them. Special attention is paid to their close relation to the well-known splitting techniques like regular and weak regular splitting methods. Extensions to block tridiagonal matrices are given, and their relation to algebraic representations of domain decomposition methods is discussed. The paper is concluded with ill…
A Property on Singularities of NURBS Curves
2002
We prove that if a.n open Non Uniform Rational B-Spline curve of order k has a singular point, then it belongs to both curves of order k - 1 defined in the k - 2 step of the de Boor algorithm. Moreover, both curves are tangent at the singular point.
Some algebras of symmetric analytic functions and their spectra
2011
AbstractIn the spectrum of the algebra of symmetric analytic functions of bounded type on ℓp, 1 ≤ p < +∞, and along the same lines as the general non-symmetric case, we define and study a convolution operation and give a formula for the ‘radius’ function. It is also proved that the algebra of analytic functions of bounded type on ℓ1 is isometrically isomorphic to an algebra of symmetric analytic functions on a polydisc of ℓ1. We also consider the existence of algebraic projections between algebras of symmetric polynomials and the corresponding subspace of subsymmetric polynomials.
On the construction, comparison, and exchangeability of tuning systems
2015
The aim of this article is to describe mathematically different tuning systems, to study their mathematical properties, and to propose a construction allowing their comparison. In order to reach these goals, we introduce a concept of similarity between tuning systems and then we provide two sufficient conditions for the particular case in which a tuning system generated by an interval and a circulating temperament are compared. Finally, we show by means of an example that, for two tuning systems to be exchangeable, some well-known results determining the suitable number of notes per octave are not enough.
Introducing a novel mesh following technique for approximation-free robotic tool path trajectories
2017
Abstract Modern tools for designing and manufacturing of large components with complex geometries allow more flexible production with reduced cycle times. This is achieved through a combination of traditional subtractive approaches and new additive manufacturing processes. The problem of generating optimum tool-paths to perform specific actions (e.g. part manufacturing or inspection) on curved surface samples, through numerical control machinery or robotic manipulators, will be increasingly encountered. Part variability often precludes using original design CAD data directly for toolpath generation (especially for composite materials), instead surface mapping software is often used to gener…
Reducing the peak and average power for OFDM systems using QAM by constellation shaping
2009
In this paper, we present a shell mapping scheme to reduce the peak and average power of orthogonal frequency division multiplexing (OFDM) signals using quadrature amplitude modulation (QAM) by constellation shaping. Our approach can be considered as an extension of the shell mapping technique introduced originally in the V.34 recommendation of ITU-T. The shell mapping method uses multiple cost functions, each having the OFDM block length N as a parameter. The cost functions are presented in closed form for any N. The main advantage of the proposed scheme is that the peak and average power can be reduced without sacrificing the data rate, and no side information is needed at the receive sid…
QR-Factorization Algorithm for Computed Tomography (CT): Comparison With FDK and Conjugate Gradient (CG) Algorithms
2018
[EN] Even though QR-factorization of the system matrix for tomographic devices has been already used for medical imaging, to date, no satisfactory solution has been found for solving large linear systems, such as those used in computed tomography (CT) (in the order of 106 equations). In CT, the Feldkamp, Davis, and Kress back projection algorithm (FDK) and iterative methods like conjugate gradient (CG) are the standard methods used for image reconstruction. As the image reconstruction problem can be modeled by a large linear system of equations, QR-factorization of the system matrix could be used to solve this system. Current advances in computer science enable the use of direct methods for…
NUMERICAL IMPLEMENTATION OF A K.A.M. ALGORITHM
1993
We discuss a numerical implementation of a K.A.M. algorithm to determine invariant tori, for systems that are quadratic in the action variables. The method has the advantage that the iteration procedure does not produce higher order terms in the actions, allowing thus a systematic control of the convergence.
Prediction of Highly Non-stationary Time Series Using Higher-Order Neural Units
2017
Adaptive predictive models can use conventional and nonconventional neural networks for highly non-stationary time series prediction. However, conventional neural networks present a series of known drawbacks. This paper presents a brief discussion about this concern as well as how the basis of higher-order neural units can overcome some of them; it also describes a sliding window technique alongside the batch optimization technique for capturing the dynamics of non-stationary time series over a Quadratic Neural Unit, a special case of higher-order neural units. Finally, an experimental analysis is presented to demonstrate the effectiveness of the proposed approach.