- About
-
The Global ETD Search service is a free service for researchers
to find electronic theses and dissertations. This service is
provided by the
Networked Digital Library of Theses and Dissertations.
Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
Search results
Showing 191 to 200 of 10867 (0.038 seconds)Spelling suggestions: "subject:"conlinear"" "subject:"collinear""
| 191 |
Solutions of some countable systems of ordinary differential equationsLaw, Alan Greenwell 05 1900 (has links)
No description available.
|
| 192 |
Projective iterative schemes for solving systems of linear equationsHawkins, John Benjamin 12 1900 (has links)
No description available.
|
| 193 |
Solutions of the differential equations of some infinite linear chains and two-dimensional arraysMartens, Walter Frederick 05 1900 (has links)
No description available.
|
| 194 |
New algorithmic approaches for semidefinite programming with applications to combinatorial optimizationBurer, Samuel A. 08 1900 (has links)
No description available.
|
| 195 |
Testing planarity in linear timeHayer, Matthias 12 1900 (has links)
No description available.
|
| 196 |
Linear model diagnostics and measurement error07 September 2010 (has links)
The general linear model, the weighted linear model, and the generalized linear model are presented in detail. Diagnostic tools for the linear models are considered. In general the standard analysis for linear models does not account for measurement error. / Thesis (M.Sc.) - University of KwaZulu-Natal, Pietermaritzburg, 2007.
|
| 197 |
The analytic center cutting plane method with semidefinite cuts /Oskoorouchi, Mohammad R. January 2002 (has links)
We propose an analytic center cutting plane algorithm for semidefinite programming (SDP). Reformulation of the dual problem of SDP into an eigenvalue optimization, when the trace of any feasible primal matrix is a positive constant, is well known. We transform the eigenvalue optimization problem into a convex feasibility problem. The problem of interest seeks a feasible point in a bounded convex set, which contains a full dimensional ball with &egr;(<1) radius and is contained in a compact convex set described by matrix inequalities, known as the set of localization. At each iteration, an approximate analytic center of the set of localization is computed. If this point is not in the solution set, an oracle is called to return a p-dimensional semidefinite cut. The set of localization then, is updated by adding the semidefinite cut through the center. We prove that the analytic center is recovered after adding a p-dimensional semidefinite cut in O(plog(p + 1)) damped Newton's iteration and that the ACCPM with semidefinite cuts is a fully polynomial approximation scheme. We report the numerical result of our algorithm when applied to the semidefinite relaxation of the Max-Cut problem.
|
| 198 |
Computational algorithms for the solution of symmetric large sparse linear systemsNair, G. Gopalakrishnan January 1976 (has links)
No description available.
|
| 199 |
A geometrical approach to linear systems based on the Riccati equationLewis, Frank Leroy 05 1900 (has links)
No description available.
|
| 200 |
Canonical forms for time-varying multivariable linear systems and periodic filtering and control applicationsPark, Baeil P. 08 1900 (has links)
No description available.
|
Page generated in 0.0431 seconds