نتایج جستجو برای: new basis functions

تعداد نتایج: 2547192  

2011
Sarah Mason Jeffrey Remmel

Haglund, Luoto, Mason, and van Willigenburg introduced a basis for quasisymmetric functions called the quasisymmetric Schur function basis, generated combinatorially through fillings of composition diagrams in much the same way as Schur functions are generated through reverse column-strict tableaux. We introduce a new basis for quasisymmetric functions called the row-strict quasisymmetric Schur...

Journal: :international journal of mathematical modelling and computations 0
a. sadeghi department of mathematics, islamic azad university, robat karim branch, tehran, iran.

the matrix functions appear in several applications in engineering and sciences. the computation of these functions almost involved complicated theory. thus, improving the concept theoretically seems unavoidable to obtain some new relations and algorithms for evaluating these functions. the aim of this paper is proposing some new reciprocal for the function of block anti diagonal matrices. more...

2000
Jong-Hwan Lee Ho-Young Jung Te-Won Lee Soo-Young Lee

In this paper, we proposed new speech features using independent component analysis to human speeches. When independent component analysis is applied to speech signals for efficient encoding the adapted basis functions resemble Gabor-like features. Trained basis functions have some redundancies, so we select some of the basis functions by reordering method. The basis functions are almost ordere...

1993
Sonia M. F. Garcia

We investigate a parabolic problem from the point of view of stability and approximation properties of increasing order mixed (in space) nite element methods. Previous estimates for the Raviart-Thomas projection are proven to be sharp. We analyze the eeects of mixed nite element discretization in space to present transient error estimates (for semidiscrete mixed nite element methods).

2006
Ivica Slavkov Ruggero Pensa Sašo Džeroski

As part of the efforts for building a unified Inductive Databases (IDBs) framework, an important step would be to find a way to combine discovered local patterns from the data with global models of predictive nature. In this paper, we investigate the possibility of using bi-sets (local patterns) as features during classification. When searching for bi-sets from Boolean data, despite reasonable ...

2006
DIETRICH BRAESS JOACHIM SCHÖBERL

A posteriori error estimates without generic constants can be obtained by a comparison of the finite element solution with a feasible function for the dual problem. A cheap computation of such functions via equilibration is well-known for scalar equations of second order. We simplify and modify the equilibration such that it can be applied to Maxwell’s equations and edge elements. The construct...

2014
JOACHIM SCHÖBERL

A posteriori error estimates without generic constants can be obtained by a comparison of the finite element solution with a feasible function for the dual problem. A cheap computation of such functions via equilibration is well-known for scalar equations of second order. We simplify and modify the equilibration such that it can be applied to Maxwell’s equations and edge elements. The construct...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه تربیت مدرس - دانشکده علوم انسانی 1390

this study investigated the functions, types and frequencies of code switching in the teachers and students discourse in elt classrooms. to this end, the participants of this study including two groups of teachers and students were selected. the first group of participants were two efl teachers teaching general english courses (at two different levels of proficiency) in an institutional program...

2012
Masayuki Yano Anthony T. Patera Karsten Urban MASAYUKI YANO ANTHONY T. PATERA

We present a space-time certified reduced basis method for Burgers’ equation over the spatial interval (0, 1) and the temporal interval (0, T ] parametrized with respect to the Peclet number. We first introduce a Petrov-Galerkin space-time finite element discretization, which enjoys a favorable inf-sup constant that decreases slowly with Peclet number and final time T . We then consider an hp i...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید