Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "projection" wg kryterium: Temat

  Lista filtrów

Dostawca treści

Wyrównaj
Wyświetlanie 1-15 z 182
Tytuł:
Contractive projections on the fixed point set of $L_∞$ contractions
Autorzy:
Lin, Michael
Sine, Robert
Powiązania:
https://bibliotekanauki.pl/articles/1396184.pdf
Data publikacji:
1991
Wydawca:
Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:
$L_∞$
projection
contraction
binary ball intersection
ergodic
positive operator
fixed point
Źródło:
Colloquium Mathematicum; 1991, 62, 1; 91-96
0010-1354
Pojawia się w:
Colloquium Mathematicum
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Nonlinear orthogonal projection
Autorzy:
Dudek, Ewa
Holly, Konstanty
Powiązania:
https://bibliotekanauki.pl/articles/1311744.pdf
Data publikacji:
1994
Wydawca:
Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:
projection's regularity and interior of its domain
Opis:
We discuss some properties of an orthogonal projection onto a subset of a Euclidean space. The special stress is laid on projection's regularity and characterization of the interior of its domain.
Źródło:
Annales Polonici Mathematici; 1994, 59, 1; 1-31
0066-2216
Pojawia się w:
Annales Polonici Mathematici
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Orthogonal polynomials and the Lanczos method
Autorzy:
Brezinski, C.
Sadok, H.
Redivo Zaglia, M.
Powiązania:
https://bibliotekanauki.pl/articles/1361029.pdf
Data publikacji:
1994
Wydawca:
Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:
projection
biconjugate gradient
orthogonal polynomials
Lanczos method
Opis:
Lanczos method for solving a system of linear equations is well known. It is derived from a generalization of the method of moments and one of its main interests is that it provides the exact answer in at most n steps where n is the dimension of the system. Lanczos method can be implemented via several recursive algorithms known as Orthodir, Orthomin, Orthores, Biconjugate gradient,... In this paper, we show that all these procedures can be explained within the framework of formal orthogonal polynomials. This theory also provides a natural basis for curing breakdown and near-breakdown in these algorithms. The case of the conjugate gradient squared method can be treated similarly.
Źródło:
Banach Center Publications; 1994, 29, 1; 19-33
0137-6934
Pojawia się w:
Banach Center Publications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Evaluating improvements of records
Autorzy:
Rychlik, Tomasz
Powiązania:
https://bibliotekanauki.pl/articles/1339205.pdf
Data publikacji:
1997
Wydawca:
Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:
monotone failure rate
monotone failure probability
record value
projection
sharp bound
variance
central absolute moment
independent identically distributed variables
Opis:
We evaluate the extreme differences between the consecutive expected record values appearing in an arbitrary i.i.d. sample in the standard deviation units. We also discuss the relevant estimates for parent distributions coming from restricted families and other scale units.
Źródło:
Applicationes Mathematicae; 1996-1997, 24, 3; 315-324
1233-7234
Pojawia się w:
Applicationes Mathematicae
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Fundamental pro-groupoids and covering projections
Autorzy:
Hernández-Paricio, Luis
Powiązania:
https://bibliotekanauki.pl/articles/1205368.pdf
Data publikacji:
1998
Wydawca:
Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:
covering projection
covering transformation
pro-groupoid, Čech fundamental pro-groupoid
covering reduced sieve
locally constant presheaf
category of fractions
subdivision
fundamental groupoid
Čech fundamental group
G-sets
continuous G-sets
Opis:
We introduce a new notion of covering projection E → X of a topological space X which reduces to the usual notion if X is locally connected. We use locally constant presheaves and covering reduced sieves to find a pro-groupoid π crs (X) and an induced category pro (π crs (X), Sets) such that for any topological space X the category of covering projections and transformations of X is equivalent to the category pro (π crs (X), Sets). We also prove that the latter category is equivalent to pro (π CX, Sets), where π CX is the Čech fundamental pro-groupoid of X. If X is locally path-connected and semilocally 1-connected, we show that π crs (X) is weakly equivalent to π X, the standard fundamental groupoid of X, and in this case pro (π crs (X), Sets) is equivalent to the functor category $Sets^{π X}$. If (X,*) is a pointed connected compact metrisable space and if (X,*) is 1-movable, then the category of covering projections of X is equivalent to the category of continuous $\check π_1 (X,*)$-sets, where $\check π_1 (X,*)$ is the Čech fundamental group provided with the inverse limit topology.
Źródło:
Fundamenta Mathematicae; 1998, 156, 1; 1-31
0016-2736
Pojawia się w:
Fundamenta Mathematicae
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Large-scale nonlinear programming algorithm using projection methods
Autorzy:
Białoń, Paweł
Powiązania:
https://bibliotekanauki.pl/articles/729340.pdf
Data publikacji:
2000
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
nonlinear optimization
large scale optimization
projection methods
zigzagging
Opis:
A method for solving large convex optimization problems is presented. Such problems usually contain a big linear part and only a small or medium nonlinear part. The parts are tackled using two specialized (and thus efficient) external solvers: purely nonlinear and large-scale linear with a quadratic goal function. The decomposition uses an alteration of projection methods. The construction of the method is based on the zigzagging phenomenon and yields a non-asymptotic convergence, not dependent on a large dimension of the problem. The method preserves its convergence properties under limitations in complicating sets by geometric cuts. Various aspects and variants of the method are analyzed theoretically and experimentally.
Źródło:
Discussiones Mathematicae, Differential Inclusions, Control and Optimization; 2000, 20, 2; 171-194
1509-9407
Pojawia się w:
Discussiones Mathematicae, Differential Inclusions, Control and Optimization
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Numerical behavior of the method of projection onto an acute cone with level control in convex minimization
Autorzy:
Dylewski, Robert
Powiązania:
https://bibliotekanauki.pl/articles/729267.pdf
Data publikacji:
2000
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
convex nondifferentiable minimization
projection method
subgradient method
acute cone
obtuse cone
Opis:
We present the numerical behavior of a projection method for convex minimization problems which was studied by Cegielski [1]. The method is a modification of the Polyak subgradient projection method [6] and of variable target value subgradient method of Kim, Ahn and Cho [2]. In each iteration of the method an obtuse cone is constructed. The obtuse cone is generated by a linearly independent system of subgradients. The next approximation of a solution is the projection onto a translated acute cone which is dual to the constructed obtuse cone. The target value which estimates the minimal objective value is updated in each iteration. The numerical tests for some tests problems are presented in which the method of Cegielski [1] is compared with the method of Kim, Ahn and Cho [2].
Źródło:
Discussiones Mathematicae, Differential Inclusions, Control and Optimization; 2000, 20, 2; 147-158
1509-9407
Pojawia się w:
Discussiones Mathematicae, Differential Inclusions, Control and Optimization
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Quasilinear vector differential equations with maximal monotone terms and nonlinear boundary conditions
Autorzy:
Bader, Ralf
Papageorgiou, Nikolaos
Powiązania:
https://bibliotekanauki.pl/articles/1208032.pdf
Data publikacji:
2000
Wydawca:
Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:
Dirichlet
maximal monotone operator
Yosida approximation
monotone operator
resolvent operator
measurable selection
demicontinuous operator
Neumann and periodic problems
coercive operator
projection theorem
Opis:
We consider a quasilinear vector differential equation which involves the p-Laplacian and a maximal monotone map. The boundary conditions are nonlinear and are determined by a generally multivalued, maximal monotone map. We prove two existence theorems. The first assumes that the maximal monotone map involved is everywhere defined and in the second we drop this requirement at the expense of strengthening the growth hypothesis on the vector field. The proofs are based on the theory of operators of monotone type and on the Leray-Schauder fixed point theorem. At the end we present some special cases (including the classical Dirichlet, Neumann and periodic problems), which illustrate the general and unifying features of our work.
Źródło:
Annales Polonici Mathematici; 2000, 73, 1; 69-92
0066-2216
Pojawia się w:
Annales Polonici Mathematici
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Signal reconstruction from given phase of the Fourier transform using Fejér monotone methods
Autorzy:
Schott, Dieter
Powiązania:
https://bibliotekanauki.pl/articles/729265.pdf
Data publikacji:
2000
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
signal reconstruction
convex feasibility problem
projection onto convex sets
Fejér monotone iterative methods
Fourier transforms
Opis:
The aim is to reconstruct a signal function x ∈ L₂ if the phase of the Fourier transform [x̂] and some additional a-priori information of convex type are known. The problem can be described as a convex feasibility problem. We solve this problem by different Fejér monotone iterative methods comparing the results and discussing the choice of relaxation parameters. Since the a-priori information is partly related to the spectral space the Fourier transform and its inverse have to be applied in each iterative step numerically realized by FFT techniques. The computation uses MATLAB routines.
Źródło:
Discussiones Mathematicae, Differential Inclusions, Control and Optimization; 2000, 20, 1; 27-40
1509-9407
Pojawia się w:
Discussiones Mathematicae, Differential Inclusions, Control and Optimization
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Two-dimensional real symmetric spaces with maximal projection constant
Autorzy:
Chalmers, Bruce
Lewicki, Grzegorz
Powiązania:
https://bibliotekanauki.pl/articles/1208018.pdf
Data publikacji:
2000
Wydawca:
Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:
absolute projection constant
minimal projection
symmetric spaces
Opis:
Let V be a two-dimensional real symmetric space with unit ball having 8n extreme points. Let λ(V) denote the absolute projection constant of V. We show that $λ(V) ≤ λ(V_n)$ where $V_n$ is the space whose ball is a regular 8n-polygon. Also we reprove a result of [1] and [5] which states that $4/π = λ(l₂^{(2)}) ≥ λ(V)$ for any two-dimensional real symmetric space V.
Źródło:
Annales Polonici Mathematici; 2000, 73, 2; 119-134
0066-2216
Pojawia się w:
Annales Polonici Mathematici
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A proposition to exploit the partially linear structure of the nonlinear multicommodity flow optimization problem
Autorzy:
Białoń, P.M.
Powiązania:
https://bibliotekanauki.pl/articles/309255.pdf
Data publikacji:
2002
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
multicommodity flow problem
projection methods
large nonlinear problems
Opis:
Optimization problems arising in telecommunications are often large-scale nonlinear problems. Usually their big size is generated mainly by their linear parts but the existence of small or medium nonlinear parts prevents us from directly tackling them with linear solvers, which are efficient. Instead, the author has proposed a method to decompose big nonlinear problems into nonlinear and linear parts. Its coordination procedure uses two auxiliary solvers: quadratic and pure nonlinear. The procedure falls in the class of projection methods. Special cuts proposed by the author allow to avoid an excessive zigzagging while not enormously increasing the complexity of both the parts. The validity of these cuts can be analyzed within the framework of obtuse cone model. Here the author summarizes the method and analyses its applicability to nonlinear multicommodity flow problems. The structure and particular sizes of this problem make the method useful. The considerations are illustrated by a numerical example with a multicommodity flow problem
Źródło:
Journal of Telecommunications and Information Technology; 2002, 3; 49-56
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Best approximations, fixed points and parametric projections
Autorzy:
Cardinali, Tiziana
Powiązania:
https://bibliotekanauki.pl/articles/729491.pdf
Data publikacji:
2002
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
fixed point
parametric projection
best approximation
upper semicontinuous
partially closed graph
f-approximatively compact
Oshman space
Opis:
If f is a continuous seminorm, we prove two f-best approximation theorems for functions Φ not necessarily continuous as a consequence of our version of Glebov's fixed point theorem. Moreover, we obtain another fixed point theorem that improves a recent result of [4]. In the last section, we study continuity-type properties of set valued parametric projections and our results improve recent theorems due to Mabizela [11].
Źródło:
Discussiones Mathematicae, Differential Inclusions, Control and Optimization; 2002, 22, 2; 243-260
1509-9407
Pojawia się w:
Discussiones Mathematicae, Differential Inclusions, Control and Optimization
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Efficient procedure for capacitance matrix calculation of multilayer VLSI interconnects using quasi-static analysis and Fourier series approach
Autorzy:
Ymeri, H.
Nauwelaers, B.
Maex, K.
Powiązania:
https://bibliotekanauki.pl/articles/309281.pdf
Data publikacji:
2002
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
lossy IC interconnect
Fourier projection method
line capacitance
Opis:
In this paper, we present a new approach for capacitance matrix calculation of lossy multilayer VLSI interconnects based on quasi-static analysis and Fourier projection technique. The formulation is independent from the position of the interconnect conductors and number of layers in the structure, and is especially adequate to model 2D and 3D layered structures with planar boundaries. Thanks to the quasi-static algorithms considered for the capacitance analysis and the expansions in terms of convergent Fourier series the tool is reliable and very efficient; results can be obtained with relatively little programming effort. The validity of the technique is verified by comparing its results with on-surface MEI method, moment method for total charges in the structure, and CAD-oriented equivalent-circuit methodology, respectively.
Źródło:
Journal of Telecommunications and Information Technology; 2002, 2; 40-44
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Partial covers of graphs
Autorzy:
Fiala, Jirí
Kratochvíl, Jan
Powiązania:
https://bibliotekanauki.pl/articles/743545.pdf
Data publikacji:
2002
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
covering projection
computational complexity
graph homomorphism
Opis:
Given graphs G and H, a mapping f:V(G) → V(H) is a homomorphism if (f(u),f(v)) is an edge of H for every edge (u,v) of G. In this paper, we initiate the study of computational complexity of locally injective homomorphisms called partial covers of graphs. We motivate the study of partial covers by showing a correspondence to generalized (2,1)-colorings of graphs, the notion stemming from a practical problem of assigning frequencies to transmitters without interference. We compare the problems of deciding existence of partial covers and of full covers (locally bijective homomorphisms), which were previously studied.
Źródło:
Discussiones Mathematicae Graph Theory; 2002, 22, 1; 89-99
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Selection strategies in projection methods for convex minimization problems
Autorzy:
Cegielski, Andrzej
Dylewski, Robert
Powiązania:
https://bibliotekanauki.pl/articles/729560.pdf
Data publikacji:
2002
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
convex minimization
projection method
long steps
residual selection
obtuse cone selection
Opis:
We propose new projection method for nonsmooth convex minimization problems. We present some method of subgradient selection, which is based on the so called residual selection model and is a generalization of the so called obtuse cone model. We also present numerical results for some test problems and compare these results with some other convex nonsmooth minimization methods. The numerical results show that the presented selection strategies ensure long steps and lead to an essential acceleration of the convergence of projection methods.
Źródło:
Discussiones Mathematicae, Differential Inclusions, Control and Optimization; 2002, 22, 1; 97-123
1509-9407
Pojawia się w:
Discussiones Mathematicae, Differential Inclusions, Control and Optimization
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 182

Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies