Temat: linear theory - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: On stability of outer inverses
Autorzy:: Regińska, Teresa
Powiązania:: https://bibliotekanauki.pl/articles/748267.pdf
Data publikacji:: 1985
Wydawca:: Polskie Towarzystwo Matematyczne
Tematy:: General theory of linear operators
Opis:: .
The paper is concerned with stability properties of bounded outer inverses for bounded operators on Banach spaces. We investigate the effect of perturbations of subspaces generating outer inverses for a given operator. We prove that the convergence of respective gaps between subspaces implies the convergence in the norm of outer inverses generated by these subspaces. The notion of outer inverses is illustrated by an example which gives the form of outer inverses for an arbitrary matrix.
Źródło:: Mathematica Applicanda; 1985, 13, 25
1730-2668
2299-4009
Pojawia się w:: Mathematica Applicanda
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

Tytuł:: Invariant approximations
Autorzy:: Smoluk, Antoni
Powiązania:: https://bibliotekanauki.pl/articles/747932.pdf
Data publikacji:: 1981
Wydawca:: Polskie Towarzystwo Matematyczne
Tematy:: Abstract approximation theory (approximation in normed linear spaces and other abstract spaces)
Opis:: W artykule uogólniono twierdzenie Meinardusa(1963). Uogólnienie to jest w dwóch kierunkach: po pierwsze, rezygnujemy z konkretnych przestrzeni funkcyjnych na rzecz dowolnych przestrzeni unormowanych i po drugie, podprzestrzeń modeli - elementów aproksymujących - może mieć wymiar dowolny. Operator, ze względu na który badamy niezmienniczość aproksymacji, jest liniowy.
From the text: "We generalize a theorem of G. Meinardus [Arch. Rational Mech. Anal. 14 (1963), 301–303; MR0156143] in two directions: first, instead of concrete function spaces we consider arbitrary normed spaces and secondly, we deal with the subspace of models-approximating elements-that can be of arbitrary measure. The operator in regard to which we study the invariability of the approximation is linear.''
Źródło:: Mathematica Applicanda; 1981, 9, 17
1730-2668
2299-4009
Pojawia się w:: Mathematica Applicanda
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 3.

Tytuł:: Minimal projective operators
Autorzy:: Lewanowicz, Stanisław
Powiązania:: https://bibliotekanauki.pl/articles/748654.pdf
Data publikacji:: 1979
Wydawca:: Polskie Towarzystwo Matematyczne
Tematy:: Abstract approximation theory (approximation in normed linear spaces and other abstract spaces)
Opis:: MR0549984
The author reviews results (without proofs) from the theory of minimal projective operators. As he remarks, an excellent introduction to this theory is the survey paper by E. W. Cheney and K. H. Price [Approximation theory (Proc. Sympos., Lancaster, 1969), pp. 261–289, Academic Press, London, 1970; MR0265842]. The author is motivated by a number of papers in this topic published after 1970, bringing essentially new results, e.g., an existence theorem for the minimal operators in the class of all projective operators from a linear normed space onto its subspace due to P. D. Morris and Cheney [J. Reine Angew. Math. 270 (1974), 61–76; MR0358188]. The paper consists of the following chapters: (0) Introduction; (1) Projective operators; (2) Fundamental properties of minimal projective operators; (3) Existence and characterization of minimal projective operators; (4) Some polynomial projective operators in the space C[−1,1]; References (45 items).
Źródło:: Mathematica Applicanda; 1979, 7, 15
1730-2668
2299-4009
Pojawia się w:: Mathematica Applicanda
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 4.

Tytuł:: Estimation of linear parametric functions in multiresponse models
Autorzy:: Walkowiak, Ryszard
Powiązania:: https://bibliotekanauki.pl/articles/747810.pdf
Data publikacji:: 1987
Wydawca:: Polskie Towarzystwo Matematyczne
Tematy:: Linear regression
Characterization and structure theory
Opis:: .
Consider an incomplete multiresponse experiment with a classification of the observations into u classes. The class Si contains ti treatments with ni observations. Thus, the experiment can be described by the set {Y1,Y2,...,Yu}, where Yi are ni×ti random matrices of observations from the class Si. For the expectation of each Yi a linear model with main and nuisance parameters is proposed. The problem of (linear) estimation of the main parameters is considered using results of R. Zmyślony [in Mathematical statistics and probability theory (Wisła, 1978), 365–373, Lecture Notes in Statist., 2, Springer, New York, 1980; MR0577292] and J. K. Baksalary [Math. Operationsforsch. Statist. Ser. Statist. 15 (1984), no. 1, 3–35; MR0729609].
Źródło:: Mathematica Applicanda; 1987, 15, 29
1730-2668
2299-4009
Pojawia się w:: Mathematica Applicanda
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 5.

Tytuł:: On a unified method for solving linear equations with constant coefficient.
Autorzy:: Muszyński, Jerzy
Powiązania:: https://bibliotekanauki.pl/articles/747338.pdf
Data publikacji:: 2004
Wydawca:: Polskie Towarzystwo Matematyczne
Tematy:: Explicit solutions and reductions
Linear equations and systems, general
General theory
Opis:: In the present paper the author studies methods for solving linear differential (difference) equations with constant coefficients. A unified approach is presented. Background information from mathematical analysis and linear algebra is also presented. This paper will be useful for teaching an introductory course on ordinary differential equations.
Źródło:: Mathematica Applicanda; 2004, 32, 46/05
1730-2668
2299-4009
Pojawia się w:: Mathematica Applicanda
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 6.

Tytuł:: An algorithm for the solution of the traveling salesman problem via disjunctive graphs
Autorzy:: Grabowski, Józef
Powiązania:: https://bibliotekanauki.pl/articles/748529.pdf
Data publikacji:: 1978
Wydawca:: Polskie Towarzystwo Matematyczne
Tematy:: Directed graphs (digraphs), tournaments
Scheduling theory, deterministic
Special problems of linear programming(transportation, multi-index, etc.)
Opis:: .
From the introduction: "The traveling salesman problem is a problem of combinatorial type. Although problems of this type sometimes have a relatively simple formulation, there are many difficulties associated with their solution even when the most up-to-date computers are used. In the 1970s many papers have been devoted to this problem. The purpose of the vast majority of them has been to find more effective solution algorithms. "In this paper we give the solution of the traveling salesman problem via disjunctive graphs. Up to now the elements of disjunctive graphs have been used to solve problems connected with the determination of an optimal task completion sequence.''
Źródło:: Mathematica Applicanda; 1978, 6, 13
1730-2668
2299-4009
Pojawia się w:: Mathematica Applicanda
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja