ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    ISSN: 1432-1211
    Keywords: Interleukin-1β cDNA Cytokine Oncorhynchus mykiss Gene organization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Medicine
    Notes: Abstract. The full-length sequence of a second IL-1 β gene (IL-1 β 2) in rainbow trout (Oncorhynchus mykiss) has been obtained. As with the first IL-1 β gene, IL-1 β 2 is organized into six exons/five introns. There are only small differences in their intron/exon sizes, with the exception of intron 3, which is 334 bp smaller in IL-1 β 2. The transcript encoded by the IL-1 β 2 gene contains a 5′ untranslated region (UTR) of 121 bp, followed by a 762-bp open reading frame and a 518-bp 3′UTR. The 3′UTR contains seven instability attta motifs, typical of inflammatory genes, and a polyadenylation site 11 bp upstream of a 17-bp poly(A) tail. The predicted 254 amino acid sequence of the second IL-1 β gene has 82% similarity to the first gene, 45% similarity to carp IL-1β, and 40% similarity to human IL-1β. Comparison of the two trout genes reveals that the IL-1 β 2 gene has a deletion of 9 bases in exon 3 and an altered splicing site at the 5′ end of exon 4 giving rise to a further 9-bp deletion in the resulting cDNA. As with other nonmammalian IL-1 β genes, no interleukin-converting enzyme (ICE) cut site has been found but the alignment of the amino acid sequence with other species shows a possible cut site between Arg89 and Ala90 that would give arise to a 165-amino acid mature peptide. Expression studies performed by RT-PCR using primers specific for the IL-1 β 2 transcript revealed a clear dose-dependent induction of this gene in cultured trout leukocytes by stimulation with lipopolysaccharide.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Numerische Mathematik 79 (1998), S. 175-202 
    ISSN: 0945-3245
    Keywords: Mathematics Subject Classification (1991):65N30, 65F10
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract. In this paper, we consider the finite element methods for solving second order elliptic and parabolic interface problems in two-dimensional convex polygonal domains. Nearly the same optimal $L^2$ -norm and energy-norm error estimates as for regular problems are obtained when the interfaces are of arbitrary shape but are smooth, though the regularities of the solutions are low on the whole domain. The assumptions on the finite element triangulation are reasonable and practical.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Numerische Mathematik 73 (1996), S. 149-167 
    ISSN: 0945-3245
    Keywords: Mathematics Subject Classification (1991):65N30, 65F10
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary. We consider two level overlapping Schwarz domain decomposition methods for solving the finite element problems that arise from discretizations of elliptic problems on general unstructured meshes in two and three dimensions. Standard finite element interpolation from the coarse to the fine grid may be used. Our theory requires no assumption on the substructures that constitute the whole domain, so the substructures can be of arbitrary shape and of different size. The global coarse mesh is allowed to be non-nested to the fine grid on which the discrete problem is to be solved, and neither the coarse mesh nor the fine mesh need be quasi-uniform. In addition, the domains defined by the fine and coarse grid need not be identical. The one important constraint is that the closure of the coarse grid must cover any portion of the fine grid boundary for which Neumann boundary conditions are given. In this general setting, our algorithms have the same optimal convergence rate as the usual two level overlapping domain decomposition methods on structured meshes. The condition number of the preconditioned system depends only on the (possibly small) overlap of the substructures and the size of the coarse grid, but is independent of the sizes of the subdomains.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Numerische Mathematik 82 (1999), S. 193-219 
    ISSN: 0945-3245
    Keywords: Mathematics Subject Classification (1991):65N30, 35L15
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Description / Table of Contents: Résumé. On résout, dans un domaine polyédrique, les équations de Maxwell temporelles. Une méthode par éléments finis discrète en temps et en espace est proposée pour calculer le champ électrique. Une estimation d'ordre optimal est obtenue pour l'erreur en norme-énergie dans le cas général. Pour la norme $L^2$ , on obtient une estimation optimale dans le cas d'un polyèdre convexe.
    Notes: Abstract. A fully discrete finite element method is used to approximate the electric field equation derived from time-dependent Maxwell's equations in three dimensional polyhedral domains. Optimal energy-norm error estimates are achieved for general Lipschitz polyhedral domains. Optimal $L^2$ -norm error estimates are obtained for convex polyhedral domains.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Amsterdam : Elsevier
    Aquaculture 111 (1993), S. 320 
    ISSN: 0044-8486
    Source: Elsevier Journal Backfiles on ScienceDirect 1907 - 2002
    Topics: Agriculture, Forestry, Horticulture, Fishery, Domestic Science, Nutrition
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 6
    ISSN: 0044-8486
    Source: Elsevier Journal Backfiles on ScienceDirect 1907 - 2002
    Topics: Agriculture, Forestry, Horticulture, Fishery, Domestic Science, Nutrition
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 7
    Electronic Resource
    Electronic Resource
    Amsterdam : Elsevier
    Aquaculture 111 (1993), S. 313-314 
    ISSN: 0044-8486
    Source: Elsevier Journal Backfiles on ScienceDirect 1907 - 2002
    Topics: Agriculture, Forestry, Horticulture, Fishery, Domestic Science, Nutrition
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 8
    Electronic Resource
    Electronic Resource
    Springer
    Numerical algorithms 9 (1995), S. 397-397 
    ISSN: 1572-9265
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 9
    Electronic Resource
    Electronic Resource
    Springer
    Numerical algorithms 8 (1994), S. 329-346 
    ISSN: 1572-9265
    Keywords: Unstructured meshes ; non-nested coarse meshes ; additive Schwarz algorithm ; optimal convergence rate ; 65N30 ; 65F10
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We give several additive Schwarz domain decomposition methods for solving finite element problems which arise from the discretizations of elliptic problems on general unstructured meshes in two and three dimensions. Our theory requires no assumption (for the main results) on the substructures which constitute the whole domain, so each substructure can be of arbitrary shape and of different size. The global coarse mesh is allowed to be non-nested to the fine grid on which the discrete problem is to be solved and both the coarse meshes and the fine meshes need not be quasi-uniform. In this general setting, our algorithms have the same optimal convergence rate of the usual domain decomposition methods on structured meshes. The condition numbers of the preconditioned systems depend only on the (possibly small) overlap of the substructures and the size of the coares grid, but is independent of the sizes of the subdomains.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 10
    Electronic Resource
    Electronic Resource
    Springer
    Numerical algorithms 13 (1996), S. 365-398 
    ISSN: 1572-9265
    Keywords: convergence ; multilevel additive methods ; unstructured meshes ; 65N30 ; 65F10
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We develop a convergence theory for two level and multilevel additive Schwarz domain decomposition methods for elliptic and parabolic problems on general unstructured meshes in two and three dimensions. The coarse and fine grids are assumed only to be shape regular, and the domains formed by the coarse and fine grids need not be identical. In this general setting, our convergence theory leads to completely local bounds for the condition numbers of two level additive Schwarz methods, which imply that these condition numbers are optimal, or independent of fine and coarse mesh sizes and subdomain sizes if the overlap amount of a subdomain with its neighbors varies proportionally to the subdomain size. In particular, we will show that additive Schwarz algorithms are still very efficient for nonselfadjoint parabolic problems with only symmetric, positive definite solvers both for local subproblems and for the global coarse problem. These conclusions for elliptic and parabolic problems improve our earlier results in [12, 15, 16]. Finally, the convergence theory is applied to multilevel additive Schwarz algorithms. Under some very weak assumptions on the fine mesh and coarser meshes, e.g., no requirements on the relation between neighboring coarse level meshes, we are able to derive a condition number bound of the orderO(ρ2 L 2), whereρ = max1≤l≤L(h l +l− 1)/δ l,h l is the element size of thelth level mesh,δ l the overlap of subdomains on thelth level mesh, andL the number of mesh levels.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...