The order of the practical system (e.g. nuclear power
plants, electrical power network and chemical plant) is
quite large. However, there are many limitations in computing
facilities for the large system. Because of these
limitations, it is often necessary to reduce the order of
the large system using an approximation....
In this thesis we examine the approximation theory of the
eigenvalue problem of bounded linear operators defined on a Banach
space, and its applications to integral and differential equations.
Special cases include the degenerate kernel method, projection method,
collocation method, the Galerkin method, the method of moments, and
the generalized...
This study deals specifically with classical cubic splines. Based on
a lemma of John Rice, best approximation in the uniform norm by
cubic splines is explored. The purpose of this study is to
characterize the best approximation to a given continuous function
f(x) by a cubic spline with fixed knots...
If P is an integer polynomial denote the degree of P by ∂(P) and let H(P) be the maximum of the absolute value of the coefficients of P. Define Λ(P)=2[superscript ∂(P)]H(P) and for a fixed prime p let C[subscript p] denote the completion of the algebraic closure of the p-adic...
This thesis considers likelihood inferences for generalized linear models with additional
random effects. The likelihood function involved ordinarily cannot be evaluated
in closed form and numerical integration is needed. The theme of the thesis is
a closed-form approximation based on Laplace's method. We first consider a special
yet important case...
For data following a balanced mixed Anova model, the standard Anova method typically leads to exact F tests of the usual hypotheses about fixed effects. However, for most unbalanced designs with most hypotheses, the Anova method does not produce exact tests, and approximate methods are needed. One approach to approximate...
There are growing interests in designing polynomial-time approximation schemes (PTAS) for optimization problems in planar graphs. Many NP-hard problems are shown to admit PTAS in planar graphs in the last decade, including Steiner tree, Steiner forest, two- edge-connected subgraphs and so on. We follow this research line and study several...