We study a multiscale discontinuous Galerkin method introduced in [10] that reduces the computational complexity of the discontinuous Galerkin method, seemingly without adversely affecting the quality of results. For a stabilized variant we are able to obtain the same error estimates for the advection-diffusion equation as for the usual discontinuous Galerkin method. We assess the stability of ...

While most knowledge engineers believe that the quality of results obtained by means of Bayesian networks is not too sensitive to imprecision in probabilities, this remains a conjecture with only modest empirical support. We summarize the results of several previously presented experiments involving Hepar II model, in which we manipulated the quality of the model’s numerical parameters and chec...

The network community structure detection problem has been recently approached with several variants of an extremal optimization algorithm. An extremal optimization algorithm is a stochastic local search method that evolves pairs of individuals that can be represented as having several components by randomly replacing components having worst fitnesses. The number of components to be replaced in...

In this note we characterize polynomial numerical hulls of matrices $A in M_n$ such that$A^2$ is Hermitian. Also, we consider normal matrices $A in M_n$ whose $k^{th}$ power are semidefinite. For such matriceswe show that $V^k(A)=sigma(A)$.

In this paper, the behavior of the pseudopolynomial numerical hull of a square complex matrix with respect to structured perturbations and its radius is investigated.

in this note we characterize polynomial numerical hulls of matrices $a in m_n$ such that$a^2$ is hermitian. also, we consider normal matrices $a in m_n$ whose $k^{th}$ power are semidefinite. for such matriceswe show that $v^k(a)=sigma(a)$.

in this paper, we consider the finitely presented groups $g_{m}$ and $k(s,l)$ as follows;$$g_{m}=langle a,b| a^m=b^m=1,~[a,b]^a=[a,b],~[a,b]^b=[a,b]rangle $$$$k(s,l)=langle a,b|ab^s=b^la,~ba^s=a^lbrangle;$$and find the $n^{th}$-commutativity degree for each of them. also we study the concept of $n$-abelianity on these groups, where $m,n,s$ and $l$ are positive integers, $m,ngeq 2$ and $g.c.d(s,...

recently, in order to increase the efficiency of least squares method in numerical solution of ill-posed problems, the chain least squares method is presented in a recurrent process by babolian et al. despite the fact that the given method has many advantages in terms of accuracy and stability, it does not have any stopping criterion and has high computational cost. in this article, the attempt...