Please use this identifier to cite or link to this item: https://hdl.handle.net/10316/109685
DC FieldValueLanguage
dc.contributor.authorHaukkanen, Pentti-
dc.contributor.authorMattila, Mika-
dc.contributor.authorMerikoski, Jorma K.-
dc.contributor.authorKovacec, Alexander-
dc.date.accessioned2023-10-20T11:55:21Z-
dc.date.available2023-10-20T11:55:21Z-
dc.date.issued2014-
dc.identifier.issn2300-7451pt
dc.identifier.urihttps://hdl.handle.net/10316/109685-
dc.description.abstractDe ne n × n tridiagonal matrices T and S as follows: All entries of the main diagonal of T are zero and those of the rst super- and subdiagonal are one. The entries of the main diagonal of S are two except the (n, n) entry one, and those of the rst super- and subdiagonal are minus one. Then, denoting by (·) the largest eigenvalue, (T) = 2 cos n + 1 , (S−1) = 1 4 cos2 n 2n+1 . Using certain lower bounds for the largest eigenvalue, we provide lower bounds for these expressions and, further, lower bounds for sin x and cos x on certain intervals. Also upper bounds can be obtained in this way.pt
dc.language.isoengpt
dc.publisherWalter de Gruyterpt
dc.rightsopenAccesspt
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/pt
dc.subjecteigenvalue boundspt
dc.subjecttrigonometric inequalitiespt
dc.titleBounds for sine and cosine via eigenvalue estimationpt
dc.typearticle-
degois.publication.issue1pt
degois.publication.titleSpecial Matricespt
dc.peerreviewedyespt
dc.identifier.doi10.2478/spma-2014-0003pt
degois.publication.volume2pt
dc.date.embargo2014-01-01*
uc.date.periodoEmbargo0pt
item.openairetypearticle-
item.fulltextCom Texto completo-
item.languageiso639-1en-
item.grantfulltextopen-
item.cerifentitytypePublications-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
Appears in Collections:FCTUC Matemática - Artigos em Revistas Internacionais
Files in This Item:
Show simple item record

Page view(s)

77
checked on Jul 17, 2024

Download(s)

27
checked on Jul 17, 2024

Google ScholarTM

Check

Altmetric

Altmetric


This item is licensed under a Creative Commons License Creative Commons