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 121 for “"Rate of convergence"”.

  1. Rate of convergence in nonlinear programming

    The rate of convergence is a useful measure of the performance of an algorithm. Knowledge of the rate can help determine which algorithm is best suited for a given problem. This research is a study of the rate of convergence of a few algorithms used for nonlinear programming problems. The …

    vt Repository record for Rate of convergence in nonlinear programming (opens in a new tab)

  2. A Rate of Convergence for Learning Theory with Consensus

    … problem with consensus that arises in the study of estimation and control strategies for distributed sensor networks. Each node i for i = 1, . . . , n of the sensor network collects independent and identically distributed local measurements {z i} := {z i j}j∈N := {(x i j , yi j )}j∈N ⊆ X × Y := Z …

    vt Repository record for A Rate of Convergence for Learning Theory with Consensus (opens in a new tab)

  3. Investigation of the rate of convergence in the two sample nonparametric empirical Bayes approach to an estimation problem

    … a finite second moment. We observe the value x, of a preliminary random variable X, which has an unknown distribution which is conditional on θ. Using x and our past experience we are asked to estimate the value of θ with a squared error loss function. After we have made our decision we are given …

    vt Repository record for Investigation of the rate of convergence in the two sample nonparametric empirical Bayes approach to an estimation problem (opens in a new tab)

  4. Estimates for the rate of convergence of finite element approximations of the solution of a time-dependent variational inequality

    The main aim of this thesis is to analyse two types of general finite element approximations to the solution of a time-dependent variational inequality. The two types of approximations considered are the following: 1. Semi-discrete approximations, in which only the spatial domain is discretised by …

    cape-town Repository record for Estimates for the rate of convergence of finite element approximations of the solution of a time-dependent variational inequality (opens in a new tab)

  5. Limit Theorems for L-functions in Analytic Number Theory

    <p>We use the method of Radziwill and Soundararajan to prove Selberg’s central limit theorem for the real part of the logarithm of the Riemann zeta function on the critical line in the multivariate case. This gives an alternate proof of a result of Bourgade. An upshot of the method is to determine …

    cuny-grad Repository record for Limit Theorems for L-functions in Analytic Number Theory (opens in a new tab)

  6. A wavelet-based CMAC for enhanced multidimensional learning

    … and associative, allowing for rapid learning convergence with an ease of implementation in either hardware or software. The rate of convergence of the network is determined largely by the choice of the receptive field shape and the generalization parameter. This research contains a rigorous …

    unh-thes Repository record for A wavelet-based CMAC for enhanced multidimensional learning (opens in a new tab)

  7. Volterra difference equations

    <p>"This dissertation consists of five papers in which discrete Volterra equations of different types and orders are studied and results regarding the behavior of their solutions are established. The first paper presents some fundamental results about subexponential sequences. It also illustrates …

    must-thes Repository record for Volterra difference equations (opens in a new tab)

  8. Spectral collocation method for compact integral operators

    … kernels and</p> <p>weakly singular kernels of the form $\frac{1}{|t-s|^\mu}, \;</p> <p>0<\mu<1. $ We prove that 1) for integral equations, the convergence</p> <p>rate depends on the smoothness of true solutions $y(t)$. If $y(t)$</p> <p>satisfies condition (R): …

    wayne-thes Repository record for Spectral collocation method for compact integral operators (opens in a new tab)

  9. Greedy Algorithms and Incoherent Systems

    … dissertation concerns estimates on the size of sets that have small coherence among the elements, the latest best upper bound on the rate of convergence of greedy expansions, and explicit formulas for approximants from the Pure Greedy Algorithm.</p>

    south-carolina Repository record for Greedy Algorithms and Incoherent Systems (opens in a new tab)

  10. Bias reduction in nonparametric hazard rate estimation

    The need of improvement of the bias rate of convergence of traditional nonparametric hazard rate estimators has been widely discussed in the literature. Initiated by recent developments in kernel density estimation we distinguish and extend three popular bias reduction methods to the hazard rate

    birmingham Repository record for Bias reduction in nonparametric hazard rate estimation (opens in a new tab)

  11. Distributed optimization and market analysis of networked systems

    In the interconnected world of today, large-scale multi-agent networked systems are ubiquitous. This thesis studies two classes of multi-agent systems, where each agent has local information and a local objective function. In the first class of systems, the agents are collaborative and the overall …

    mit Repository record for Distributed optimization and market analysis of networked systems (opens in a new tab)

  12. Three Essays on Investigating Province-Level Carbon Dioxide Emissions in China

    … this dissertation study the influential factors of energy-related carbon dioxide emission intensity, whether the province-level carbon dioxide emission intensity is convergence, and how the spatial panel data models perform in forecasting against non-spatial panel data models for province-level …

    wvu Repository record for Three Essays on Investigating Province-Level Carbon Dioxide Emissions in China (opens in a new tab)

  13. Sato-Tate Problem for GL(3)

    Based upon the work of Goldfeld and Kontorovich on the Kuznetsov trace formula of Maass forms for SL(3,Z), we prove a weighted vertical equidistribution theorem (with respect to the generalized Sato-Tate measure) for the p-th Hecke eigenvalue of Maass forms, with the rate of convergence. With a …

    columbia-diss Repository record for Sato-Tate Problem for GL(3) (opens in a new tab)

  14. The updated subspaces method in optimization and in solving linear systems of equations

    … minimization problems, has flexibility of choosing different quadratic approximation at each iteration and therefore has potential of improving the rate of convergence given by the quasi-Newton method. In this dissertation, the convergence behavior of the UCS method is investigated and …

    uiuc Repository record for The updated subspaces method in optimization and in solving linear systems of equations (opens in a new tab)

  15. Levenberg-Marquardt Algorithms for Nonlinear Equations, Multi-objective Optimization, and Complementarity Problems

    … a classical method for solving nonlinear systems of equations that can come from various applications in engineering and economics. Recently, Levenberg-Marquardt methods turned out to be a valuable principle for obtaining fast convergence to a solution of the nonlinear system if the classical …

    qucosa-diss

  16. A study of a moving contact algorithm

    … inelastic behavior in the interlocks of steel sheet pile sections subjected to axial tension. Previously, numerical instabilities were encountered during the solution process while conducting a series of verification problems for the algorithm by the Newton-Raphson method. In an …

    vt Repository record for A study of a moving contact algorithm (opens in a new tab)

  17. ΑΣΥΜΠΤΩΤΙΚΗ ΜΕΤΑΒΛΗΤΟΤΗΤΑ ΣΕ ΜΗ ΟΜΟΓΕΝΗ ΜΑΡΚΟΒΙΑΝΑ ΣΥΣΤΗΜΑΤΑ- ΑΠΕΙΡΟΓΙΝΟΜΕΝΑ ΠΙΝΑΚΩΝ ΜΕ ΑΘΡΟΙΣΜΑ ΣΤΟΙΧΕΙΩΝ ΚΑΘΕ ΓΡΑΜΜΗΣ 1

    WE EXAMINED THE ASYMPTOTIC BEHAVIOUR OF THE RECTOR M(T) OF MEANS, VARIANCES ANDCOVARIANCES IN NON-HOMOGENEOUS MARKOV SYSTEMS (NHMS) IN THE MOST GENERAL CASE - WHEN THE AUGMENTED MATRIX OF THE SYSTEM IS PERIODIC - AND AS A SPECIAL CASE THE ASYMPTOTIC BEHAVIOUR IN THE HOMOGENEOUS MARKOV SYSTEMS …

    greece Repository record for ΑΣΥΜΠΤΩΤΙΚΗ ΜΕΤΑΒΛΗΤΟΤΗΤΑ ΣΕ ΜΗ ΟΜΟΓΕΝΗ ΜΑΡΚΟΒΙΑΝΑ ΣΥΣΤΗΜΑΤΑ- ΑΠΕΙΡΟΓΙΝΟΜΕΝΑ ΠΙΝΑΚΩΝ ΜΕ ΑΘΡΟΙΣΜΑ ΣΤΟΙΧΕΙΩΝ ΚΑΘΕ ΓΡΑΜΜΗΣ 1 (opens in a new tab)

  18. On Solving the Large Sparse Generalized Eigenvalue Problem

    … is developed which requires the solution of linear algebraic systems only to the accuracy demanded by a given subspace. The convergence of the method is discussed, and the rate of convergence is improved by using shifting with the Ritz approximations. Numerical results are presented, and …

    uiuc Repository record for On Solving the Large Sparse Generalized Eigenvalue Problem (opens in a new tab)

  19. Orthogonalization techniques for adaptive filters

    The rate of convergence and the computational complexity of an adaptive algorithm are two essential criteria by which the performance of an adaptive filter is measured. These objectives conflict with one another; each property is successfully achieved at the expense of the other. The principal …

    uiuc Repository record for Orthogonalization techniques for adaptive filters (opens in a new tab)

Page 1 of 7