Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 33 for “"Computational mathematics"”.

  1. Construction of Piecewise Linear Wavelets.

    <p>It is well known that in many areas of computational mathematics, wavelet based algorithms are becoming popular for modeling and analyzing data and for providing efficient means for hierarchical data decomposition of function spaces into mutually orthogonal wavelet spaces. Wavelet construction …

    etsu Repository record for Construction of Piecewise Linear Wavelets. (opens in a new tab)

  2. Polynomial decomposition algorithms in signal processing

    … has attracted considerable attention in computational mathematics. In general, the field identifies polynomials f(x) and g(x) such that their composition f(g(x)) equals or approximates a given polynomial h(x). Despite potentially promising applications, polynomial decomposition has not …

    mit Repository record for Polynomial decomposition algorithms in signal processing (opens in a new tab)

  3. Computational Approaches to Improving Room Heating and Cooling for Energy Efficiency in Buildings

    … thesis we develop methodology to link commercial Computational Fluid Dynamics (CFD) software COMSOL with standard computational mathematics software MATLAB, and design controllers that apply inlet airflow and heating or cooling to a room and investigate their effects. First, an appropriate …

    vt Repository record for Computational Approaches to Improving Room Heating and Cooling for Energy Efficiency in Buildings (opens in a new tab)

  4. Some problems in polynomial interpolation and topological complexity

    … thesis is comprised of two projects in applied computational mathematics. In Chapter 1, we discuss the geometry and combinatorics of geometrically characterized sets. These are finite sets of n+d choose n points in R^d which impose independent conditions on polynomials of degree n, and which …

    uiuc Repository record for Some problems in polynomial interpolation and topological complexity (opens in a new tab)

  5. The Foundations of Infinite-Dimensional Spectral Computations

    … addresses the broad question, “What is computationally possible within the field of spectral theory of separable Hilbert spaces?” The boundaries of what computers can achieve in computational spectral theory and mathematical physics are unknown, leaving many open questions that have been …

    cambridge Repository record for The Foundations of Infinite-Dimensional Spectral Computations (opens in a new tab)

  6. Numerical Solution of Sturm–Liouville Problems via Fer Streamers

    … conditions. These are classical problems in computational mathematics which lie on the interface between numerical analysis and spectral theory, with important applications in physics and chemistry, not least in the approximation of energy levels and wave functions of quantum systems. Because …

    cambridge Repository record for Numerical Solution of Sturm–Liouville Problems via Fer Streamers (opens in a new tab)

  7. Generalization and properties of the neural response

    … introduced by Smale et al. in the paper "Mathematics of the Neural Response", Foundations of Computational Mathematics, 2010. We propose a generalized definition of the neural response and derived kernel that allows us to integrate some of the existing hierarchical algorithms in practice …

    mit Repository record for Generalization and properties of the neural response (opens in a new tab)

  8. SOLVING PROCESS PLANNING AND SCHEDULING PROBLEMS USING THE CONCEPT OF MAXIMUM WEIGHTED INDEPENDENT SET

    … achieve satisfactory results in both quality and computational speed. Other studies formulate scheduling problems as a graph coloring problem (GCP) or its extensions, but these formulations are limited to certain types of scheduling problems. In this dissertation, we propose a novel approach to …

    syracuse-diss Repository record for SOLVING PROCESS PLANNING AND SCHEDULING PROBLEMS USING THE CONCEPT OF MAXIMUM WEIGHTED INDEPENDENT SET (opens in a new tab)

  9. Analyses and Applications of the Peaceman--Rachford and Douglas--Rachford Splitting Schemes

    Splitting methods are widely used as temporal discretizations of evolution equations. Such methods usually constitute competitive choices whenever a vector field can be split into a sum of two or more parts that each generates a flow easier to compute or approximate than the flow of the sum. In the …

    lund Repository record for Analyses and Applications of the Peaceman--Rachford and Douglas--Rachford Splitting Schemes (opens in a new tab)

  10. Polynomial systems : graphical structure, geometry, and applications

    … equations is a foundational problem in computational mathematics, that has several applications in the sciences and engineering. A closely related problem, also prevalent in applications, is that of optimizing polynomial functions subject to polynomial constraints. In this thesis we …

    mit Repository record for Polynomial systems : graphical structure, geometry, and applications (opens in a new tab)

  11. Properties of some minimum run resolution IV designs

    The regular resolution TV fractional factorial designs described in the have many desirable properties; main effect estimates are uncorrelated and are unbiased by two-factor interactions, whilst estimates of the two-factor interaction effects are limited to the identification of a significant …

    vu-aus Repository record for Properties of some minimum run resolution IV designs (opens in a new tab)

  12. Option pricing in a path integral framework

    This dissertation is an examination of methods for computing an option price using a path integral framework. The framework, developed by Chiarella, El-Hassan and Kucera, is based on the Black and Scholes paradigm. The path integral is backward recursive with the payoff known at expiry and has no …

    vu-aus Repository record for Option pricing in a path integral framework (opens in a new tab)

  13. Os poliedros por uma perspectiva diferente: Origamis, papercrafts, canudos, softwares e jogo.

    Our work aims to suggest general play activities or materials from concrete or mathematical software to be developed within the area of teaching geometry, specificity, content Polyhedra. Our goal was born from the experience we had in the course of supervised IV, offered by the Federal University …

    brazil-ufpb Repository record for Os poliedros por uma perspectiva diferente: Origamis, papercrafts, canudos, softwares e jogo. (opens in a new tab)

  14. Precision of the path of steepest ascent in response surface methodology

    This thesis provides some extensions to the existing method of determining the precision of the path of steepest ascent in response surface methodology to cover situations with correlated and heteroscedastic responses, including the important class of generalised linear models. It is shown how the …

    vu-aus Repository record for Precision of the path of steepest ascent in response surface methodology (opens in a new tab)

  15. A complementary heuristic for the unbounded knapsack problem

    … (1992) and Kohli and Krishnamurti (1992). The computational tests fail to show clear superiority of any particular heuristic algorithm, although each heuristic produces good quality solutions. If the combination of the density-ordered greedy and the total-value greedy heuristics are considered …

    vu-aus Repository record for A complementary heuristic for the unbounded knapsack problem (opens in a new tab)

  16. Hermite-Hadamard inequality in the geometry of banach spaces

    … made significant contributions in many areas of mathematics. The purpose of this dissertation is to employ inequalities in studying the geometry of a Banach space. Motivated by the Hermite-Hadamard inequality, a new family of norms is defined, which is called the p-HH-norm. The research outcomes …

    vu-aus Repository record for Hermite-Hadamard inequality in the geometry of banach spaces (opens in a new tab)

  17. Operador de consecuencias extendido por agregadores formales para modelar bases de datos con incertidumbre

    … quantifiers (Fuzzy Sets and Systems) [129]. Computational reaching of quantified consequences from imperfect initial data (Mathematical Methods in the Applied Sciences) [122]. Computational technique for obtaining consequences in multi-adjoint logic programming with generalized quantifiers …

    cadiz Repository record for Operador de consecuencias extendido por agregadores formales para modelar bases de datos con incertidumbre (opens in a new tab)

  18. Design and development of intelligent computational techniques for power quality data monitoring and management

    … in EPDS is quite high, the aggregate analysis is computationally involved. In addition, the cost involved with the PQ shortcomings is significantly high (for domestic consumers and rises exponentially for industrial consumers), hence it also becomes mandatory to project /predict the undesired PQ …

    vu-aus Repository record for Design and development of intelligent computational techniques for power quality data monitoring and management (opens in a new tab)

  19. Approximation of wave packets on the whole real line

    … n and ω for a given accuracy ε, and the computational efficiency of evaluating the expansion coefficients. We assume that the parameter n is large as it denotes the number of basis functions used to approximate a function. Moreover, we are interested in approximating highly oscillatory …

    cambridge Repository record for Approximation of wave packets on the whole real line (opens in a new tab)

Page 1 of 2