Informacja

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

Wyszukujesz frazę "symmetric" wg kryterium: Temat


Tytuł:
$L^p$-$L^q$-Time decay estimate for solution of the Cauchy problem for hyperbolic partial differential equations of linear thermoelasticity
Autorzy:
Gawinecki, Jerzy
Powiązania:
https://bibliotekanauki.pl/articles/1313322.pdf
Data publikacji:
1991
Wydawca:
Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:
decay estimates
partial differential equations
Cauchy problem
symmetric hyperbolic system of first order
linear thermoelasticity
Opis:
We prove the $L^p$-$L^q$-time decay estimates for the solution of the Cauchy problem for the hyperbolic system of partial differential equations of linear thermoelasticity. In our proof based on the matrix of fundamental solutions to the system we use Strauss-Klainerman's approach [12], [5] to the $L^p$-$L^q$-time decay estimates.
Źródło:
Annales Polonici Mathematici; 1991, 54, 2; 135-145
0066-2216
Pojawia się w:
Annales Polonici Mathematici
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
$L^p$-spaces and quantum dynamical semigroups
Autorzy:
Goldstein, Stanisław
Lindsay, J.
Powiązania:
https://bibliotekanauki.pl/articles/1342202.pdf
Data publikacji:
1998
Wydawca:
Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:
C*-algebra
symmetric embedding
von Neumann algebra
weight
$L^p$-space
Markov semigroup
positivity
KMS-symmetry
Dirichlet form
Źródło:
Banach Center Publications; 1998, 43, 1; 211-216
0137-6934
Pojawia się w:
Banach Center Publications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A categorical model of predicate linear logic
Autorzy:
Demeterová, E.
Mihályi, D.
Novitzká, V.
Powiązania:
https://bibliotekanauki.pl/articles/122570.pdf
Data publikacji:
2015
Wydawca:
Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:
linear type theory
predicate linear logic
symmetric monoidal closed category
Opis:
Linear logic is one of the logical systems with special properties suitable for describing real processes used in computer science. It enables one to specify dynamics, non determinism, consecutive processes and important resources as memory and time on syntactic level. Moreover, its deduction system enables one to verify specified properties. Constructing an appropriate model based on categories can serve for modeling various program systems in the wide spectrum of computer science. Mainly, propositional linear logic is used for these purposes. The expression power of linear logic significantly grows by extending propositional logic with predicates and quantifiers. Our paper concerns itself with defining predicate linear logic together with its deduction system and our main aim is to construct a categorical model of predicate linear logic as a symmetric monoidal closed category.
Źródło:
Journal of Applied Mathematics and Computational Mechanics; 2015, 14, 1; 27-42
2299-9965
Pojawia się w:
Journal of Applied Mathematics and Computational Mechanics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A characterization of maximal regular ideals in lmc algebras
Autorzy:
Fragoulopoulou, Maria
Powiązania:
https://bibliotekanauki.pl/articles/1293115.pdf
Data publikacji:
1992
Wydawca:
Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:
symmetric lmc*-algebra
LFQ-algebra
maximal ideal space
Lindelöf space
Opis:
A question of Warner and Whitley concerning a nonunital version of the Gleason-Kahane-Żelazko theorem is considered in the context of nonnormed topological algebras. Among other things it is shown that a closed hyperplane M of a commutative symmetric F*-algebra E with Lindelöf Gel'fand space is a maximal regular ideal iff each element of M belongs to some closed maximal regular ideal of E.
Źródło:
Studia Mathematica; 1992, 103, 1; 41-49
0039-3223
Pojawia się w:
Studia Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A Comparative Study between CS-LBP/SVM and CS-LBP/PCA in Facial Expression Recognition
Autorzy:
Gaur, Sheena
Powiązania:
https://bibliotekanauki.pl/articles/1075570.pdf
Data publikacji:
2019
Wydawca:
Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
Tematy:
Center symmetric local binary patterns (CS-LBP)
Facial Expression Analysis
Principal Component Analysis 9PCA)
Support Vector Machine (SVM)
Opis:
Face plays significant role in social communication. This is a 'window' to human personality, emotions and thoughts. Due to this, face is a subject of study in many areas of science such as psychology, behavioral science, medicine and computer science etc. In this paper, a comparative study is suggested between CS-LBP/SVM and CS-LBP/PCA. These algorithms are used in emotive facial expression recognition. Finally, a comparison is shown between PCA & SVM in terms of Dimension Reduction. The proposed system uses grayscale frontal face images of a Japanese female to classify six basic emotions namely happiness, sadness, disgust, fear, surprise and anger.
Źródło:
World Scientific News; 2019, 121; 83-89
2392-2192
Pojawia się w:
World Scientific News
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A general boundary value problem and its Weyl function
Autorzy:
Ryzhov, V.
Powiązania:
https://bibliotekanauki.pl/articles/255861.pdf
Data publikacji:
2007
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
abstract boundary value problem
symmetric operators
Green formula
Weyl function
Opis:
We study the abstract boundary value problem defined in terms of the Green identity and introduce the concept of Weyl operator function M(·) that agrees with other definitions found in the current literature. In typical cases of problems arising from the multidimensional partial equations of mathematical physics the function M(·) takes values in the set of unbounded densely defined operators acting on the auxiliary boundary space. Exact formulae are obtained and essential properties of M(·) are studied. In particular, we consider boundary problems defined by various boundary conditions and justify the well known procedure that reduces such problems to the "equation on the boundary" involving the Weyl function, prove an analogue of the Borg-Levinson theorem, and link our results to the classical theory of extensions of symmetric operators.
Źródło:
Opuscula Mathematica; 2007, 27, 2; 305-331
1232-9274
2300-6919
Pojawia się w:
Opuscula Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A method for solving a system of linear equations with a symmetric indefinite coefficient matrix
Autorzy:
Czochralska, Izabela
Powiązania:
https://bibliotekanauki.pl/articles/748583.pdf
Data publikacji:
2006
Wydawca:
Polskie Towarzystwo Matematyczne
Tematy:
Gaussian elimination, triangular and triangular-diagonal factorization of a matrix, numerically stable diagonalization of a symmetric indefinite matrix.
Opis:
The subject of this article is a numerically stable method for solving nonsingular Cramerian systems of linear equations, with a symmetric indefinite coefficient matrix. It consists in adapting the algorithm presented in [1] that can stably and effectively diagonalize any indefinite symmetric matrix. It is in fact some modification of the Gaussian symmetric elimination procedure.
Źródło:
Mathematica Applicanda; 2006, 34, 48/07
1730-2668
2299-4009
Pojawia się w:
Mathematica Applicanda
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A model of a radially symmetric cloud of self-attracting particles
Autorzy:
Nadzieja, Tadeusz
Powiązania:
https://bibliotekanauki.pl/articles/1340313.pdf
Data publikacji:
1995
Wydawca:
Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:
asymptotic behavior
cloud of particles
nonlinear parabolic equation
radially symmetric solutions
Opis:
We consider a parabolic equation which describes the gravitational interaction of particles. Existence of solutions and their convergence to stationary states are studied.
Źródło:
Applicationes Mathematicae; 1995-1996, 23, 2; 169-178
1233-7234
Pojawia się w:
Applicationes Mathematicae
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A note on strict K-monotonicity of some symmetric function spaces
Autorzy:
Ciesielski, Maciej
Kolwicz, Paweł
Płuciennik, Ryszard
Powiązania:
https://bibliotekanauki.pl/articles/745027.pdf
Data publikacji:
2013
Wydawca:
Polskie Towarzystwo Matematyczne
Tematy:
Koethe space, K-monotonicity, strict K-monotonicity, symmetric
Opis:
We discuss some sufficient and necessary conditions for strict K-monotonicity of some important concrete symmetric spaces. The criterion for strict monotonicity of the Lorentz space \(\Gamma _{p,w}\) with \(0\)
Źródło:
Commentationes Mathematicae; 2013, 53, 2
0373-8299
Pojawia się w:
Commentationes Mathematicae
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A parallel algorithm of icsym forcomplexsymmetric linear systems in quantum chemistry
Autorzy:
Zhang, Y.
Lv, Q.
Xiao, M.
Xie, G.
Breitkopf, P.
Powiązania:
https://bibliotekanauki.pl/articles/305677.pdf
Data publikacji:
2018
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
complex symmetric linear systems
parallel computing
improved conjugate gradient-type iterative algorithm (ICSYM)
Opis:
Computational effort is a common issue for solving large-scale complex symmetric linear systems, particularly in quantum chemistry applications. In order to alleviate this problem, we propose a parallel algorithm of improved conjugate gradient-type iterative (ICSYM). Using three-term recurrence relation and or- thogonal properties of residual vectors to replace the tridiagonalization process of classical CSYM, which allows to decrease the degree of the reduce-operator from two to one communication at each iteration and to reduce the amount of vector updates and vector multiplications. Several numerical examples are implemented to show that high performance of proposed improved version is obtained both in convergent rate and in parallel efficiency.
Źródło:
Computer Science; 2018, 19 (4); 385-401
1508-2806
2300-7036
Pojawia się w:
Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A parallel block Lanczos algorithm and its implementation for the evaluation of some eigenvalues of large sparse symmetric matrices on multicomputers
Autorzy:
Guarracino, M. R.
Perla, F.
Zanetti, P.
Powiązania:
https://bibliotekanauki.pl/articles/908413.pdf
Data publikacji:
2006
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
cluster architecture
symmetric block Lanczos algorithm
sparse matrices
parallel eigensolver
algorytm Lanczosa
macierze rzadkie
architektura klastrowa
Opis:
In the present work we describe HPEC (High Performance Eigenvalues Computation), a parallel software package for the evaluation of some eigenvalues of a large sparse symmetric matrix. It implements an efficient and portable Block Lanczos algorithm for distributed memory multicomputers. HPEC is based on basic linear algebra operations for sparse and dense matrices, some of which have been derived by ScaLAPACK library modules. Numerical experiments have been carried out to evaluate HPEC performance on a cluster of workstations with test matrices from Matrix Market and Higham’s collections. A comparison with a PARPACKroutine is also detailed. Finally, parallel performance is evaluated on random matrices, using standard parameters.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2006, 16, 2; 241-249
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A random walk version of Robbins problem: small horizon
Autorzy:
Allaart, Pieter
Allen, Andrew
Powiązania:
https://bibliotekanauki.pl/articles/953267.pdf
Data publikacji:
2019
Wydawca:
Polskie Towarzystwo Matematyczne
Tematy:
robbins' problem
stopping time
symmetric random walk
expected rank
proces ornsteina-uhlenbecka
floc
estymacja
rozkłas stabilny
Opis:
In Robbins' problem of minimizing the expected rank, a finite sequence of $n$ independent, identically distributed random variables are observed sequentially and the objective is to stop at such a time that the expected rank of the selected variable (among the sequence of all $n$ variables) is as small as possible. In this paper we consider an analogous problem in which the observed random variables are the steps of a symmetric random walk. Assuming continuously distributed step sizes, we describe the optimal stopping rules for the cases $n=2$ and $n=3$ in two versions of the problem: a ``full information" version in which the actual steps of the random walk are disclosed to the decision maker; and a ``partial information" version in which only the relative ranks of the positions taken by the random walk are observed. When $n=3$, the optimal rule and expected rank depend on the distribution of the step sizes. We give sharp bounds for the optimal expected rank in the partial information version, and fairly sharp bounds in the full information version.
Źródło:
Mathematica Applicanda; 2019, 47, 2
1730-2668
2299-4009
Pojawia się w:
Mathematica Applicanda
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A Symmetric Approach in the Three-Dimensional Digital Waveguide Modeling of the Vocal Tract
Autorzy:
Mushtaq, Tahir
Kamran, Ahmad
Qureshi, Muhammad Zubair Akbar
Iqbal, Zafar
Powiązania:
https://bibliotekanauki.pl/articles/31339832.pdf
Data publikacji:
2023
Wydawca:
Polska Akademia Nauk. Czasopisma i Monografie PAN
Tematy:
symmetric
digital waveguide
vocal tract
delay lines
rectilinear uniform grid
Opis:
Simulation of wave propagation in the three-dimensional (3D) modeling of the vocal tract has shown significant promise for enhancing the accuracy of speech production. Recent 3D waveguide models of the vocal tract have been designed for better accuracy but require a lot of computational tasks. A high computational cost in these models leads to novel work in reducing the computational cost while retaining accuracy and performance. In the current work, we divide the geometry of the vocal tract into four equal symmetric parts with the introduction of two axial perpendicular planes, and the simulation is performed on only one part. A novel strategy is defined to implement symmetric conditions in the mesh. The complete standard 3D digital waveguide model is assumed as a benchmark model. The proposed model is compared with the benchmark model in terms of formant frequencies and efficiency. For the demonstration, the vowels /ɔ/, /i/, /ɛ/, /ɑ/, and /u/ have been selected for the simulations. According to the results, the benchmark and current models are nearly identical in terms of frequency profiles and formant frequencies. Still the current model is three times more effective than the benchmark model.
Źródło:
Archives of Acoustics; 2023, 48, 3; 317-324
0137-5075
Pojawia się w:
Archives of Acoustics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
About a certain relation between two polynomials of the same degree
Autorzy:
Piwowarczyk, T.
Powiązania:
https://bibliotekanauki.pl/articles/229447.pdf
Data publikacji:
2011
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
roots of polynomials
symmetric polynomials
companion matrix
eigenvalues
transformations
Opis:
This article presents several different methods for solving the problem of how to find a certain relation defined in chapter 2. The first method deals with the identities known in the theory of symmetric polynomials as the elements of a certain vector space. The second method is designed around the matrix transformations between symmetric polynomials. The third method is designed around the property of a linear operator and its characteristic polynomial. The fourth method is designed in the area of complex numbers, and introduces the multiplication group of 'complex roots of one'. Significant improvement in the third and fourth method is made by introducing so called 'block method'. It facilitates all calculations by making them much shorter. The article ends with an example showing symmetry and regularity of all procedures. Finally, the article shows how to solve the problem for any degree n of the polynomial, and for any degree k. At the end of the paper solutions for n < 5 and k < 5 are tabulated.
Źródło:
Archives of Control Sciences; 2011, 21, 1; 85-103
1230-2384
Pojawia się w:
Archives of Control Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Adjointness between theories and strict theories
Autorzy:
Vogel, Hans-Jürgen
Powiązania:
https://bibliotekanauki.pl/articles/728926.pdf
Data publikacji:
2003
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
symmetric monoidal category
dhts-category
partial theory
adjoint functor
Opis:
The categorical concept of a theory for algebras of a given type was foundet by Lawvere in 1963 (see [8]). Hoehnke extended this concept to partial heterogenous algebras in 1976 (see [5]). A partial theory is a dhts-category such that the object class forms a free algebra of type (2,0,0) freely generated by a nonempty set J in the variety determined by the identities ox ≈ o and xo ≈ o, where o and i are the elements selected by the 0-ary operation symbols.
If the object class of a dhts-category forms even a monoid with unit element I and zero element O, then one has a strict partial theory.
In this paper is shown that every J-sorted partial theory corresponds in a natural manner to a J-sorted strict partial theory via a strongly d-monoidal functor. Moreover, there is a pair of adjoint functors between the category of all J-sorted theories and the category of all corresponding J-sorted strict theories.
This investigation needs an axiomatic characterization of the fundamental properties of the category Par of all partial function between arbitrary sets and this characterization leads to the concept of dhts- and dhth∇s-categories, respectively (see [5], [11], [13]).
Źródło:
Discussiones Mathematicae - General Algebra and Applications; 2003, 23, 2; 163-212
1509-9415
Pojawia się w:
Discussiones Mathematicae - General Algebra and Applications
Dostawca treści:
Biblioteka Nauki
Artykuł

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