Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Spherical functions. --- Euclidean algorithm. --- Algorithm of Euclid --- Continued division --- Division, Continued --- Euclid algorithm --- Euclidian algorithm --- Euclid's algorithm --- Algorithms --- Number theory --- Functions, Spherical --- Spherical harmonics --- Transcendental functions --- Spheroidal functions --- Funcions esferoïdals --- Algorismes --- Algorisme d'Euclides --- Algoritmes --- Àlgebra --- Algorismes computacionals --- Algorismes genètics --- Anàlisi numèrica --- Funcions recursives --- Programació (Matemàtica) --- Programació (Ordinadors) --- Teoria de màquines --- Traducció automàtica --- Funcions harmòniques

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Evolving from an elementary discussion, this book develops the Euclidean algorithm to a very powerful tool to deal with general continued fractions, non-normal Padé tables, look-ahead algorithms for Hankel and Toeplitz matrices, and for Krylov subspace methods. It introduces the basics of fast algorithms for structured problems and shows how they deal with singular situations. Links are made with more applied subjects such as linear system theory and signal processing, and with more advanced topics and recent results such as general bi-orthogonal polynomials, minimal Padé approximation, poly

Ordered algebraic structures --- Numerical approximation theory --- Computer science --- lineaire algebra --- Algebras, Linear --- Euclidean algorithm --- Orthogonal polynomials --- Padé approximant --- #TELE:SISTA --- 519.6 --- 681.3*G11 --- 681.3*G12 --- 681.3*G13 --- Algorithm of Euclid --- Continued division --- Division, Continued --- Euclid algorithm --- Euclidian algorithm --- Euclid's algorithm --- Algorithms --- Number theory --- Linear algebra --- Algebra, Universal --- Generalized spaces --- Mathematical analysis --- Calculus of operations --- Line geometry --- Topology --- 681.3*G13 Numerical linear algebra: conditioning; determinants; Eigenvalues; error analysis; linear systems; matrix inversion; pseudoinverses; sparse and very largesystems --- Numerical linear algebra: conditioning; determinants; Eigenvalues; error analysis; linear systems; matrix inversion; pseudoinverses; sparse and very largesystems --- 681.3*G12 Approximation: chebyshev; elementary function; least squares; linear approximation; minimax approximation and algorithms; nonlinear and rational approximation; spline and piecewise polynomial approximation (Numerical analysis) --- Approximation: chebyshev; elementary function; least squares; linear approximation; minimax approximation and algorithms; nonlinear and rational approximation; spline and piecewise polynomial approximation (Numerical analysis) --- 681.3*G11 Interpolation: difference formulas; extrapolation; smoothing; spline and piecewise polynomial interpolation (Numerical analysis) --- Interpolation: difference formulas; extrapolation; smoothing; spline and piecewise polynomial interpolation (Numerical analysis) --- 519.6 Computational mathematics. Numerical analysis. Computer programming --- Computational mathematics. Numerical analysis. Computer programming --- Fourier analysis --- Functions, Orthogonal --- Polynomials --- Approximant, Padé --- Approximation theory --- Continued fractions --- Power series --- Euclidean algorithm. --- Algebras, Linear. --- Padé approximant. --- Orthogonal polynomials. --- Padé approximant. --- Pade approximant.

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

The Euclidean shortest path (ESP) problem asks the question: what is the path of minimum length connecting two points in a 2- or 3-dimensional space? Variants of this industrially-significant computational geometry problem also require the path to pass through specified areas and avoid defined obstacles. This unique text/reference reviews algorithms for the exact or approximate solution of shortest-path problems, with a specific focus on a class of algorithms called rubberband algorithms. Discussing each concept and algorithm in depth, the book includes mathematical proofs for many of the given statements. Suitable for a second- or third-year university algorithms course, the text enables readers to understand not only the algorithms and their pseudocodes, but also the correctness proofs, the analysis of time complexities, and other related topics. Topics and features: Provides theoretical and programming exercises at the end of each chapter Presents a thorough introduction to shortest paths in Euclidean geometry, and the class of algorithms called rubberband algorithms Discusses algorithms for calculating exact or approximate ESPs in the plane Examines the shortest paths on 3D surfaces, in simple polyhedrons and in cube-curves Describes the application of rubberband algorithms for solving art gallery problems, including the safari, zookeeper, watchman, and touring polygons route problems Includes lists of symbols and abbreviations, in addition to other appendices This hands-on guide will be of interest to undergraduate students in computer science, IT, mathematics, and engineering. Programmers, mathematicians, and engineers dealing with shortest-path problems in practical applications will also find the book a useful resource. Dr. Fajie Li is at Huaqiao University, Xiamen, Fujian, China. Prof. Dr. Reinhard Klette is at the Tamaki Innovation Campus of The University of Auckland.

Computational complexity. --- Computer aided design. --- Computer science. --- Computer science -- Mathematics. --- Computer software. --- Electronic data processing. --- Euclidean algorithm. --- Optical pattern recognition. --- Graph algorithms --- Mathematics --- Engineering & Applied Sciences --- Physical Sciences & Mathematics --- Algebra --- Computer Science --- Mathematical analysis. --- Algebraic spaces. --- Spaces, Algebraic --- 517.1 Mathematical analysis --- Mathematical analysis --- Algorithm of Euclid --- Continued division --- Division, Continued --- Euclid algorithm --- Euclidian algorithm --- Euclid's algorithm --- Algorithms. --- Numerical analysis. --- Computer science --- Pattern recognition. --- Computer-aided engineering. --- Computer Science. --- Algorithm Analysis and Problem Complexity. --- Numeric Computing. --- Pattern Recognition. --- Discrete Mathematics in Computer Science. --- Math Applications in Computer Science. --- Computer-Aided Engineering (CAD, CAE) and Design. --- Mathematics. --- Geometry, Algebraic --- Algorithms --- Number theory --- CAD (Computer-aided design) --- Computer-assisted design --- Computer-aided engineering --- Design --- Informatics --- Science --- Complexity, Computational --- Electronic data processing --- Machine theory --- Optical data processing --- Pattern perception --- Perceptrons --- Visual discrimination --- ADP (Data processing) --- Automatic data processing --- Data processing --- EDP (Data processing) --- IDP (Data processing) --- Integrated data processing --- Computers --- Office practice --- Software, Computer --- Computer systems --- Automation --- Computer science—Mathematics. --- CAE --- Engineering --- Design perception --- Pattern recognition --- Form perception --- Perception --- Figure-ground perception --- Algorism --- Arithmetic --- Foundations