Virtual Element Methods for plate bending problems (Articolo in rivista)

Type
Label
  • Virtual Element Methods for plate bending problems (Articolo in rivista) (literal)
Anno
  • 2013-01-01T00:00:00+01:00 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#doi
  • 10.1016/j.cma.2012.09.012 (literal)
Alternative label
  • Franco Brezzi; L. Donatella Marini (2013)
    Virtual Element Methods for plate bending problems
    in Computer methods in applied mechanics and engineering; Elsevier BV, Amsterdam (Paesi Bassi)
    (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori
  • Franco Brezzi; L. Donatella Marini (literal)
Pagina inizio
  • 455 (literal)
Pagina fine
  • 462 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#url
  • http://www.sciencedirect.com/science/article/pii/S0045782512002940 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#numeroVolume
  • 253 (literal)
Rivista
Note
  • Scopu (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#affiliazioni
  • Istituto Universitario di Studi Superiori, Pavia, Italy; King Abdulaziz University, Dept. of Math., PO Box 80203, Jeddah 21589, Saudi Arabia; IMATI-CNR, Via Ferrata 1, 27100 Pavia, Italy; Dipartimento di Matematica, Università di Pavia, Via Ferrata 1, 27100 Pavia, Italy (literal)
Titolo
  • Virtual Element Methods for plate bending problems (literal)
Abstract
  • We discuss the application of Virtual Elements to linear plate bending problems, in the Kirchhoff-Love formulation. As we shall see, in the Virtual Element environment the treatment of the C1C1-continuity condition is much easier than for traditional Finite Elements. The main difference consists in the fact that traditional Finite Elements, for every element K and for every given set of degrees of freedom, require the use of a space of polynomials (or piecewise polynomials for composite elements) for which the given set of degrees of freedom is unisolvent. For Virtual Elements instead we only need unisolvence for a space of smooth functions that contains a subset made of polynomials (whose degree determines the accuracy). As we shall see the non-polynomial part of our local spaces does not need to be known in detail, and therefore the construction of the local stiffness matrix is simple, and can be done for much more general geometries. (literal)
Editore
Prodotto di
Autore CNR
Insieme di parole chiave

Incoming links:


Prodotto
Autore CNR di
Editore di
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#rivistaDi
Insieme di parole chiave di
data.CNR.it