Relevant bibliographies by topics / Numerical approximation algorithms / Dissertations / Theses
To see the other types of publications on this topic, follow the link: Numerical approximation algorithms.

Dissertations / Theses on the topic 'Numerical approximation algorithms'

Author: Grafiati
Published: 5 June 2025
Last updated: 2 August 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 28 dissertations / theses for your research on the topic 'Numerical approximation algorithms.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Javed, Mohsin. "Algorithms for trigonometric polynomial and rational approximation." Thesis, University of Oxford, 2016. https://ora.ox.ac.uk/objects/uuid:23a36d72-0299-4c63-98e8-d0aa088c062e.

Full text
Abstract:
This thesis presents new numerical algorithms for approximating functions by trigonometric polynomials and trigonometric rational functions. We begin by reviewing trigonometric polynomial interpolation and the barycentric formula for trigonometric polynomial interpolation in Chapter 1. Another feature of this chapter is the use of the complex plane, contour integrals and phase portraits for visualising various properties and relationships between periodic functions and their Laurent and trigonometric series. We also derive a periodic analogue of the Hermite integral formula which enables us to
APA, Harvard, Vancouver, ISO, and other styles
2

Pachon, Ricardo. "Algorithms for polynomial and rational approximation." Thesis, University of Oxford, 2010. http://ora.ox.ac.uk/objects/uuid:f268a835-46ef-45ea-8610-77bf654b9442.

Full text
Abstract:
Robust algorithms for the approximation of functions are studied and developed in this thesis. Novel results and algorithms on piecewise polynomial interpolation, rational interpolation and best polynomial and rational approximations are presented. Algorithms for the extension of Chebfun, a software system for the numerical computation with functions, are described. These algorithms allow the construction and manipulation of piecewise smooth functions numerically with machine precision. Breakpoints delimiting subintervals are introduced explicitly, implicitly or automatically, the latter metho
APA, Harvard, Vancouver, ISO, and other styles
3

Valenzuela, Zaldy M. "Constant and power-of-2 segmentation algorithms for a high speed numerical function generator." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2005. http://library.nps.navy.mil/uhtbin/hyperion/05Jun%5FValenzuela.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Mishchenko, Kateryna. "Numerical Algorithms for Optimization Problems in Genetical Analysis." Doctoral thesis, Västerås : Scool of education, Culture and Communication, Mälardalen University, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-650.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Platte, Rodrigo B. "Accuracy and stability of global radial basis function methods for the numerical solution of partial differential equations." Access to citation, abstract and download form provided by ProQuest Information and Learning Company; downloadable PDF file 8.72Mb, 143 p, 2005. http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&res_dat=xri:pqdiss&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&rft_dat=xri:pqdiss:3181853.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Tung, Michael Ming-Sha. "Spline approximations for systems of ordinary differential equations." Doctoral thesis, Universitat Politècnica de València, 2013. http://hdl.handle.net/10251/31658.

Full text
Abstract:
El objetivo de esta tesis doctoral es desarrollar nuevos métodos basados en splines para la resolución de sistemas de ecuaciones diferenciales del tipo Y'(x)=f(x,Y(x)) , a<x<b Y(a)=Y_a (1) donde Y_a, Y(x) son matrices rxq, comenzando con splines de tipo cúbico y con un algoritmo similar al propuesto por Loscalzo y Talbot en el caso escalar [20], intentando poder aumentar el orden del spline, lo que con el método dado en [20] no puede hacerse de forma convergente. Trataremos también de aplicar dicho método al problema Y''(x)=f(x,Y(x),Y'(x)) , a<x<b Y(a)=Y_a Y'(a)=Y_b
APA, Harvard, Vancouver, ISO, and other styles
7

Silva, Nunes Ana Luisa. "Spectral approximation with matrices issued from discretized operators." Phd thesis, Université Jean Monnet - Saint-Etienne, 2012. http://tel.archives-ouvertes.fr/tel-00952977.

Full text
Abstract:
In this thesis, we consider the numerical solution of a large eigenvalue problem in which the integral operator comes from a radiative transfer problem. It is considered the use of hierarchical matrices, an efficient data-sparse representation of matrices, especially useful for large dimensional problems. It consists on low-rank subblocks leading to low memory requirements as well as cheap computational costs. We discuss the use of the hierarchical matrix technique in the numerical solution of a large scale eigenvalue problem arising from a finite rank discretization of an integral operator. T
APA, Harvard, Vancouver, ISO, and other styles
8

Whitinger, Robert. "An Algorithm for the Machine Calculation of Minimal Paths." Digital Commons @ East Tennessee State University, 2016. https://dc.etsu.edu/etd/3119.

Full text
Abstract:
Problems involving the minimization of functionals date back to antiquity. The mathematics of the calculus of variations has provided a framework for the analytical solution of a limited class of such problems. This paper describes a numerical approximation technique for obtaining machine solutions to minimal path problems. It is shown that this technique is applicable not only to the common case of finding geodesics on parameterized surfaces in R3, but also to the general case of finding minimal functionals on hypersurfaces in Rn associated with an arbitrary metric.
APA, Harvard, Vancouver, ISO, and other styles
9

Savas, Berkant. "Algorithms in data mining using matrix and tensor methods." Doctoral thesis, Linköpings universitet, Beräkningsvetenskap, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-11597.

Full text
Abstract:
In many fields of science, engineering, and economics large amounts of data are stored and there is a need to analyze these data in order to extract information for various purposes. Data mining is a general concept involving different tools for performing this kind of analysis. The development of mathematical models and efficient algorithms is of key importance. In this thesis we discuss algorithms for the reduced rank regression problem and algorithms for the computation of the best multilinear rank approximation of tensors. The first two papers deal with the reduced rank regression problem,
APA, Harvard, Vancouver, ISO, and other styles
10

Nguyen, Hung The. "Big Networks: Analysis and Optimal Control." VCU Scholars Compass, 2018. https://scholarscompass.vcu.edu/etd/5514.

Full text
Abstract:
The study of networks has seen a tremendous breed of researches due to the explosive spectrum of practical problems that involve networks as the access point. Those problems widely range from detecting functionally correlated proteins in biology to finding people to give discounts and gain maximum popularity of a product in economics. Thus, understanding and further being able to manipulate/control the development and evolution of the networks become critical tasks for network scientists. Despite the vast research effort putting towards these studies, the present state-of-the-arts largely eith
APA, Harvard, Vancouver, ISO, and other styles
11

Prados, Emmanuel. "Application of the theory of the viscosity solutions to the Shape From Shading problem." Phd thesis, Université de Nice Sophia-Antipolis, 2004. http://tel.archives-ouvertes.fr/tel-00007916.

Full text
Abstract:
Le problème du « Shape From Shading » est aujourd'hui considéré comme un problème mal posé et difficile à résoudre. Afin de bien comprendre les difficultés de ce problème et d'apporter des solutions fiables et pertinentes, nous proposons une approche rigoureuse basée sur la notion de solution de viscosité.<br />Après avoir considéré et exploité au maximum les équations (aux dérivées partielles) obtenues à partir de la modélisation classique du problème du « Shape From Shading », nous proposons et étudions de nouvelles équations provenant de modélisations plus réalistes que celles qui avaient é
APA, Harvard, Vancouver, ISO, and other styles
12

Hörmann, Wolfgang, and Josef Leydold. "Continuous Random Variate Generation by Fast Numerical Inversion." Department of Statistics and Mathematics, Abt. f. Angewandte Statistik u. Datenverarbeitung, WU Vienna University of Economics and Business, 2002. http://epub.wu.ac.at/664/1/document.pdf.

Full text
Abstract:
The inversion method for generating non-uniform random variates has some advantages compared to other generation methods, since it monotonically transforms uniform random numbers into non-uniform random variates. Hence it is the method of choice in the simulation literature. However, except for some simple cases where the inverse of the cumulative distribution function is a simple function we need numerical methods. Often inversion by ``brute force" is used, applying either very slow iterative methods or linear interpolation of the CDF and huge tables. But then the user has to accept unnecessa
APA, Harvard, Vancouver, ISO, and other styles
13

Caron, Armand. "Approximations numeriques de problemes non lineaires : linearisation et resolution par un algorithme sous contrainte de regularite." Paris 6, 1987. http://www.theses.fr/1987PA066002.

Full text
Abstract:
Generalisation de la methode iterative sous contrainte de regularite a des equations integrales non lineaires et singulieres, a des equations integrodifferentielles, differentielles et aux derivees partielles. Comparaison entre les resultats numeriques et les solutions theoriques. Insertion d'une contrainte supplementaire a la contrainte de regularite pour le traitement des problemes non lineaires a plusieurs solutions. Exemples numeriques
APA, Harvard, Vancouver, ISO, and other styles
14

Badreddine, Siwar. "Symétries et structures de rang faible des matrices et tenseurs pour des problèmes en chimie quantique." Electronic Thesis or Diss., Sorbonne université, 2024. http://www.theses.fr/2024SORUS029.

Full text
Abstract:
Cette thèse présente de nouveaux algorithmes numériques et effectue une étude approfondie de certaines méthodes numériques existantes pour relever les défis de haute dimension résultant de la résolution de l'équation de Schrödinger électronique en chimie quantique. En se concentrant sur deux problèmes spécifiques, notre approche implique l'identification et l'exploitation des symétries et des structures de rang faible au sein de matrices et de tenseurs. Le premier problème abordé dans cette thèse concerne l'évaluation numérique efficace de la composante à longue portée du potentiel de Coulomb
APA, Harvard, Vancouver, ISO, and other styles
15

Nachaoui, Mourad. "Étude théorique et approximation numérique d'un problème inverse de transfert de la chaleur." Phd thesis, Université de Nantes, 2011. http://tel.archives-ouvertes.fr/tel-00678032.

Full text
Abstract:
Nous nous intéressons à l'étude d'un problème d'analyse des transferts de chaleur qui modélise une opération de soudage. L'approche que nous considérons ne s'occupe que de la partie solide de la plaque. Elle consiste à résoudre un problème à frontière libre. Pour cela, nous proposons une formulation en optimisation de forme. Le problème d'état est gouverné par un opérateur qui, pour certaines données, n'est pas coercif. Cela complique l'étude de la continuité du problème d'état. Nous surmontons cette difficulté en utilisant le degré topologique de Leray-Shauder, ainsi nous montrons l'existence
APA, Harvard, Vancouver, ISO, and other styles
16

Nascimento, Amanda Melo do. "Frações contínuas e aplicações no ensino médio." Universidade Federal de Goiás, 2013. http://repositorio.bc.ufg.br/tede/handle/tede/3678.

Full text
Abstract:
Submitted by Luciana Ferreira (lucgeral@gmail.com) on 2014-11-24T11:32:03Z No. of bitstreams: 2 Mestrado - Amanda Melo do Nascimento - 2013.pdf: 1240146 bytes, checksum: 0126ba6aa1a69a061f1ffabfaf21e9be (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5)<br>Approved for entry into archive by Luciana Ferreira (lucgeral@gmail.com) on 2014-11-24T14:00:24Z (GMT) No. of bitstreams: 2 Mestrado - Amanda Melo do Nascimento - 2013.pdf: 1240146 bytes, checksum: 0126ba6aa1a69a061f1ffabfaf21e9be (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5)<b
APA, Harvard, Vancouver, ISO, and other styles
17

Vie, Jean-Léopold. "Second-order derivatives for shape optimization with a level-set method." Thesis, Paris Est, 2016. http://www.theses.fr/2016PESC1072/document.

Full text
Abstract:
Le but de cette thèse est de définir une méthode d'optimisation de formes qui conjugue l'utilisation de la dérivée seconde de forme et la méthode des lignes de niveaux pour la représentation d'une forme.On considèrera d'abord deux cas plus simples : un cas d'optimisation paramétrique et un cas d'optimisation discrète.Ce travail est divisé en quatre parties.La première contient le matériel nécessaire à la compréhension de l'ensemble de la thèse.Le premier chapitre rappelle des résultats généraux d'optimisation, et notamment le fait que les méthodes d'ordre deux ont une convergence quadratique s
APA, Harvard, Vancouver, ISO, and other styles
18

Cao, Liang. "Numerical analysis and multi-precision computational methods applied to the extant problems of Asian option pricing and simulating stable distributions and unit root densities." Thesis, University of St Andrews, 2014. http://hdl.handle.net/10023/6539.

Full text
Abstract:
This thesis considers new methods that exploit recent developments in computer technology to address three extant problems in the area of Finance and Econometrics. The problem of Asian option pricing has endured for the last two decades in spite of many attempts to find a robust solution across all parameter values. All recently proposed methods are shown to fail when computations are conducted using standard machine precision because as more and more accuracy is forced upon the problem, round-off error begins to propagate. Using recent methods from numerical analysis based on multi-precision
APA, Harvard, Vancouver, ISO, and other styles
19

Nguyen, Huu Phuc. "Développement d'une commande à modèle partiel appris : analyse théorique et étude pratique." Thesis, Compiègne, 2016. http://www.theses.fr/2016COMP2323/document.

Full text
Abstract:
En théorie de la commande, un modèle du système est généralement utilisé pour construire la loi de commande et assurer ses performances. Les équations mathématiques qui représentent le système à contrôler sont utilisées pour assurer que le contrôleur associé va stabiliser la boucle fermée. Mais, en pratique, le système réel s’écarte du comportement théorique modélisé. Des non-linéarités ou des dynamiques rapides peuvent être négligées, les paramètres sont parfois difficiles à estimer, des perturbations non maitrisables restent non modélisées. L’approche proposée dans ce travail repose en parti
APA, Harvard, Vancouver, ISO, and other styles
20

Giraldi, Loïc. "Contributions aux méthodes de calcul basées sur l'approximation de tenseurs et applications en mécanique numérique." Phd thesis, Ecole centrale de nantes - ECN, 2012. http://tel.archives-ouvertes.fr/tel-00861986.

Full text
Abstract:
Cette thèse apporte différentes contributions à la résolution de problèmes de grande dimension dans le domaine du calcul scientifique, en particulier pour la quantification d'incertitudes. On considère ici des problèmes variationnels formulés dans des espaces produit tensoriel. On propose tout d'abord une stratégie de préconditionnement efficace pour la résolution de systèmes linéaires par des méthodes itératives utilisant des approximations de tenseurs de faible rang. Le préconditionneur est recherché comme une approximation de faible rang de l'inverse. Un algorithme glouton permet le calcul
APA, Harvard, Vancouver, ISO, and other styles
21

Lunot, Vincent. "Techniques d'approximation rationnelle en synthèse fréquentielle : problème de Zolotarev et algorithme de Schur." Phd thesis, Université de Provence - Aix-Marseille I, 2008. http://tel.archives-ouvertes.fr/tel-00711860.

Full text
Abstract:
Cette thèse présente des techniques d'optimisation et d'approximation rationnelle ayant des applications en synthèse et identification de systèmes passifs. La première partie décrit un problème de Zolotarev : on cherche à maximiser sur une famille d'intervalles l'infimum du module d'une fonction rationnelle de degré donné, tout en contraignant son module à ne pas dépasser 1 sur une autre famille d'intervalles. On s'intéresse dans un premier temps à l'existence et à la caractérisation des solutions d'un tel problème. Deux algorithmes, de type Remes et correction différentielle, sont ensuite pré
APA, Harvard, Vancouver, ISO, and other styles
22

Figueroa, Leonardo E. "Deterministic simulation of multi-beaded models of dilute polymer solutions." Thesis, University of Oxford, 2011. http://ora.ox.ac.uk/objects/uuid:4c3414ba-415a-4109-8e98-6c4fa24f9cdc.

Full text
Abstract:
We study the convergence of a nonlinear approximation method introduced in the engineering literature for the numerical solution of a high-dimensional Fokker--Planck equation featuring in Navier--Stokes--Fokker--Planck systems that arise in kinetic models of dilute polymers. To do so, we build on the analysis carried out recently by Le~Bris, Leli\`evre and Maday (Const. Approx. 30: 621--651, 2009) in the case of Poisson's equation on a rectangular domain in $\mathbb{R}^2$, subject to a homogeneous Dirichlet boundary condition, where they exploited the connection of the approximation method wit
APA, Harvard, Vancouver, ISO, and other styles
23

Malmgren, Henrik. "Revision of an artificial neural network enabling industrial sorting." Thesis, Uppsala universitet, Institutionen för teknikvetenskaper, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-392690.

Full text
Abstract:
Convolutional artificial neural networks can be applied for image-based object classification to inform automated actions, such as handling of objects on a production line. The present thesis describes theoretical background for creating a classifier and explores the effects of introducing a set of relatively recent techniques to an existing ensemble of classifiers in use for an industrial sorting system.The findings indicate that it's important to use spatial variety dropout regularization for high resolution image inputs, and use an optimizer configuration with good convergence properties. T
APA, Harvard, Vancouver, ISO, and other styles
24

Mendelsohn, Philip C. "Theory and numerical implementation of greedy algorithms in highly nonlinear approximation." 2006. http://hdl.handle.net/1993/20846.

Full text
APA, Harvard, Vancouver, ISO, and other styles
25

Chen, Lujuan. "Parallel processing strategies for solving differential equations and approximation problems." Phd thesis, 1995. http://hdl.handle.net/1885/138070.

Full text
Abstract:
The n ed for effective parallel methods for solving problems in science and engineering well recognized. Not only do we require algorithms which map well onto practical parallel machines, we also need methods which have well understood convergence and stability properties. In this thesis we devise techniques and parallel algorithms for solving differential equations and for data approximation, the two fundamental building blocks in scientific and engineering computing.
APA, Harvard, Vancouver, ISO, and other styles
26

Prentice, Justin Steven Calder. "Incorporation of the first derivative of the objective function into the linear training of a radial basis function neural network for approximation via strict interpolation." Thesis, 2014. http://hdl.handle.net/10210/11569.

Full text
APA, Harvard, Vancouver, ISO, and other styles
27

(20390), Baolin Wu. "Fuzzy modelling and identification with genetic algorithms based learning." Thesis, 1996. https://figshare.com/articles/thesis/Fuzzy_modelling_and_identification_with_genetic_algorithms_based_learning/21345057.

Full text
Abstract:
<p>Modelling is an essential step towards a solution to complex system problems. Traditional mathematical methods are inadequate in describing the complex systems when the complexity increases. Fuzzy logic has provided an alternative way in dealing with complexity in real world.</p> <p>This thesis looks at a practical approach for complex system modelling using fuzzy logic. This approach is usually called fuzzy modelling. The main aim of this thesis is to explore the capabilities of fuzzy logic in complex system modelling using available data. The fuzzy model concerned is the Sugeno-Takage-Kan
APA, Harvard, Vancouver, ISO, and other styles
28

(9179300), Evgenia-Maria Kontopoulou. "RANDOMIZED NUMERICAL LINEAR ALGEBRA APPROACHES FOR APPROXIMATING MATRIX FUNCTIONS." Thesis, 2020.

Find full text
Abstract:
<p>This work explores how randomization can be exploited to deliver sophisticated</p><p>algorithms with provable bounds for: (i) The approximation of matrix functions, such</p><p>as the log-determinant and the Von-Neumann entropy; and (ii) The low-rank approximation</p><p>of matrices. Our algorithms are inspired by recent advances in Randomized</p><p>Numerical Linear Algebra (RandNLA), an interdisciplinary research area that exploits</p><p>randomization as a computational resource to develop improved algorithms for</p><p>large-scale linear algebra problems. The main goal of this work is to enc
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the bibliographies on the topic 'Numerical approximation algorithms' for other source types:
Journal articles Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography