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 109 for “"iterative method"”.

  1. An Iterative Method for Canonical Polyadic Decomposition of Tensors

    … approximate decomposition that can be improved iteratively would be ideal, allowing one to stop the iterations when a desired level of accuracy is reached, without having to compute all components first and then truncate the series. In this work, we develop such an approach. We begin with …

    claremont Repository record for An Iterative Method for Canonical Polyadic Decomposition of Tensors (opens in a new tab)

  2. A Polynomial Based Iterative Method for Linear Parabolic Equations

    A new polynomial based method (PBM) is developed to integrate multi-dimensional linear parabolic initial-boundary-value problems. It is based on $L\sb2$-approximations to $f(z) = (1 - exp(-z))/z,f(0) = 1,$ over ellipses in the complex plane using expansions of f in Chebychev polynomials. The …

    uiuc Repository record for A Polynomial Based Iterative Method for Linear Parabolic Equations (opens in a new tab)

  3. Prediction of regenerator thermal performance using a non-iterative method of computation

    … has undertaken the further development of a non-iterative method for predicting the fluid temperature variations in a counterflow regenerator operating at cyclic equilibrium. The method utilises the closed-form solutions derived by earlier workers from the equations of the regenerator, …

    southwales Repository record for Prediction of regenerator thermal performance using a non-iterative method of computation (opens in a new tab)

  4. An Iterative Method for Solving Nonsymmetric Linear Systems With Dynamic Estimation of Parameters

    Made available in DSpace on 2014-12-14T13:09:27Z (GMT). No. of bitstreams: 1 7606854.pdf: 4599366 bytes, checksum: a872f24ed765aff02aa6956ccbf8c8e6 (MD5) Previous issue date: 1975

    uiuc Repository record for An Iterative Method for Solving Nonsymmetric Linear Systems With Dynamic Estimation of Parameters (opens in a new tab)

  5. Performance Evaluation of New Corrugated-Type Embossments for Composite Deck

    … those given by different strength prediction methods that are alternatives to full-scale testing. The methods used in this study are the First Yield Method (Heagler 1992), the ASCE Appendix D Alternate Method (Standard 1992), and Widjaja's (1997) Iterative Method. Shear bond tests are also …

    vt Repository record for Performance Evaluation of New Corrugated-Type Embossments for Composite Deck (opens in a new tab)

  6. Vectorization and microtasking of UTCHEM on the CRAY X-MP

    … CRAY X-MP. Details of implementation of these methods on UTCHEM and possible extension to other reservoir simulators were discussed. Speedup factors of up to 40 by a combination of vectorization and microtasking on a two-processor CRAY X-MP were observed. Higher speedup factors were observed on …

    texas Repository record for Vectorization and microtasking of UTCHEM on the CRAY X-MP (opens in a new tab)

  7. An iterative pressure-correction method for the unsteady incompressible Navier-Stokes Equation

    The pressure-correction projection method for the incompressible Navier-Stokes equation is approached as a preconditioned Richardson iterative method for the pressure- Schur complement equation. Typical pressure correction methods perform only one iteration and suffer from a splitting error that …

    mit Repository record for An iterative pressure-correction method for the unsteady incompressible Navier-Stokes Equation (opens in a new tab)

  8. Parallel Methods for the Solution of Large-Scale Radiation and Inverse Scattering Problems

    … This is paired with the distorted-Born iterative method (DBIM) for inverse scattering. DBIM requires repeated solutions of the forward problem to compute an image. With the linear complexity offered by the MLFMA forward solver, DBIM reconstructions proceed with greatly-reduced …

    uiuc Repository record for Parallel Methods for the Solution of Large-Scale Radiation and Inverse Scattering Problems (opens in a new tab)

  9. Approximation methods for output regulation of nonlinear systems

    The goal of this work is to develop an iterative method for obtaining approximate feedback laws for solving problems of geometric output regulation for a nonlinear system governed by Burgers' equation. We also present a method for solving the linearized output regulation problem which provides …

    ttu Repository record for Approximation methods for output regulation of nonlinear systems (opens in a new tab)

  10. A consistent direct-iterative inverse design method for the Euler equations

    A new, consistent direct-iterative method is proposed for the solution of the aerodynamic inverse design problem. Direct-iterative methods couple analysis and shape modification methods to iteratively determine the geometry required to support a target surface pressure. The proposed method includes …

    vt Repository record for A consistent direct-iterative inverse design method for the Euler equations (opens in a new tab)

  11. The development of a minimum weight design algorithm using fully stressed design iteration

    … presents the development and results of an iterative method for obtaining a minimum weight structural design, called an optimum design. The optimum design iteration is based on a sequence of fully stressed designs, each intermediate design possessing a distinct set of allowable stresses that …

    vt Repository record for The development of a minimum weight design algorithm using fully stressed design iteration (opens in a new tab)

  12. Fast Polarizable Force Field Computation in Biomolecular Simulations

    … each timestep in molecular dynamics simulations. Methods are developed that reduce the cost of computing the electrostatic energy and force of a polarizable model from about 7.5 times the cost of computing those of a non-polarizable model to less than twice the cost. The reduction is achieved by …

    uiuc Repository record for Fast Polarizable Force Field Computation in Biomolecular Simulations (opens in a new tab)

  13. Fast Algorithms for the Design and Analysis of Large Power Grids

    … optimization is a fast localized node-based iterative method to compute the voltages after each movement of pads. Experimental results show that our algorithm demonstrates good runtime characteristics for power grids with large numbers of pad candidates in multimillion-size circuits.

    uiuc Repository record for Fast Algorithms for the Design and Analysis of Large Power Grids (opens in a new tab)

  14. Polynomial Preconditioning for Conjugate Gradient Methods

    … applications. If A is large and sparse, an iterative method is required. When A is hermitian positive definite (hpd), the conjugate gradient method of Hestenes and Stiefel is popular. When A is hermitian indefinite (hid), the conjugate residual method may be used. If A is ill-conditioned, …

    uiuc Repository record for Polynomial Preconditioning for Conjugate Gradient Methods (opens in a new tab)

  15. Computer Simulation of Biological Ion Channels

    … realistic models of biological ion channels. An iterative method of solution, in which the dielectric boundary is tiled with variable sized surface charge sectors, provides the flexibility to deal with arbitrarily shaped boundaries, but is too slow to perform Brownian dynamics. An analytical …

    aus-cath Repository record for Computer Simulation of Biological Ion Channels (opens in a new tab)

  16. Computer Simulation of Biological Ion Channels

    … realistic models of biological ion channels. An iterative method of solution, in which the dielectric boundary is tiled with variable sized surface charge sectors, provides the flexibility to deal with arbitrarily shaped boundaries, but is too slow to perform Brownian dynamics. An analytical …

    anu Repository record for Computer Simulation of Biological Ion Channels (opens in a new tab)

  17. Preconditioned iterative methods for highly sparse, nonsymmetric, unstructured linear algebra problems

    … sparse, nonsymmetric, and unstructured. Several iterative methods which are applicable to nonsymmetric and indefinite problems are applied to a suite of test problems derived from simulations of actual bipolar circuits and to a viscous flow problem. Methods tested include Craig’s method, …

    vt Repository record for Preconditioned iterative methods for highly sparse, nonsymmetric, unstructured linear algebra problems (opens in a new tab)

  18. A Modified Preconditioned Conjugate Gradient Method for Approximating the Scattering Amplitude

    <p>In this thesis, we look at an iterative method for approximating the scattering amplitude that involves solving two linear systems: a forward system A<strong>x</strong>=<strong>b</strong> and an adjoint system A<sup>T</sup><strong>y</strong>=<strong>g</strong>. Once these two systems are solved, …

    usm Repository record for A Modified Preconditioned Conjugate Gradient Method for Approximating the Scattering Amplitude (opens in a new tab)

  19. Quadrilateral Remeshing and Efficient Surface Parameterization

    … parameterization. We present two complementary methods for automatically improving mesh parameterization, and demonstrate that they provide a desirable combination of efficiency and quality. First, we describe a new iterative method for constructing quasi-conformal parameterizations with free …

    uiuc Repository record for Quadrilateral Remeshing and Efficient Surface Parameterization (opens in a new tab)

  20. Efficient Iterative Methods for Saddle Point Problems

    This thesis investigates efficient iterative methods for a type of saddle-point problem, namely the generalized Stokes problem, which arises frequently in the simulation of time-dependent Navier-Stokes equations for incompressible fluid flow. These systems are indefinite due to a set of linear …

    uiuc Repository record for Efficient Iterative Methods for Saddle Point Problems (opens in a new tab)

Page 1 of 6