Raven in the Grave

Raven in the Grave is the fifth studio album by The Raveonettes,[5] and was released April 4, 2011. Several of the songs included on the album are English re-recordings of songs found on Wagner's solo album.

Raven in the Grave
Studio album by
ReleasedApril 4, 2011
Recorded2010
GenreIndie rock,[1] shoegaze, noise pop, post-punk revival
Length35:42
LabelVice Records
ProducerThe Raveonettes
The Raveonettes chronology
In and Out of Control
(2009)
Raven in the Grave
(2011)
Rarities/B-Sides
(2011)
Singles from Raven in the Grave
  1. "Recharge and Revolt"
    Released: March 7, 2011[2]
  2. "Apparitions"
    Released: May 31, 2011[3]
  3. "Let Me on Out"
    Released: November 15, 2011[4]

Reception

Professional ratings
Aggregate scores
SourceRating
Metacritic66/100[6]
Review scores
SourceRating
AllMusic[7]
Pitchfork Media5.7/10[8]
Slant Magazine[9]
Spin[10]

The album received generally positive reviews upon its release. At Metacritic, which assigns a normalised rating out of 100 to reviews from mainstream critics, the album received an average score of 66, based on 18 reviews, which indicates "Generally favorable reviews".[6]

Since its release, Sune Rose Wagner has expressed disappointment with the album, stating it would have worked better as a soundtrack and that the song structures are "quite unusual compared to everything else [The Raveonettes have] done".[11]

Track listing

All tracks are written by Sune Rose Wagner.

No.TitleLength
1."Recharge & Revolt"5:23
2."War in Heaven"4:42
3."Forget That You're Young"3:57
4."Apparitions"3:55
5."Summer Moon"3:04
6."Let Me on Out"2:36
7."Ignite"3:05
8."Evil Seeds"4:17
9."My Time's Up"4:43
Amazon.com bonus track[12]
No.TitleLength
10."No Joy"3:51
iTunes bonus track[13]
No.TitleLength
10."As You Lay Asleep"3:18
Super Deluxe Edition bonus track[14]
No.TitleLength
10."Sun goes down"2:56
gollark: you PENGUINS.
gollark: HAS YOUR NOSE EXPLODED?
gollark: ```haskellimport Data.Listimport Data.Bits fib :: Int -> Integerfib n = snd . foldl_ fib_ (1, 0) . dropWhile not $ [testBit n k | k <- let s = bitSize n in [s-1,s-2..0]] where fib_ (f, g) p | p = (f*(f+2*g), ss) | otherwise = (ss, g*(2*f-g)) where ss = f*f+g*g foldl_ = foldl' -- '```
gollark: import Data.Listimport Data.Bits fib :: Int -> Integerfib n = snd . foldl_ fib_ (1, 0) . dropWhile not $ [testBit n k | k <- let s = bitSize n in [s-1,s-2..0]] where fib_ (f, g) p | p = (f*(f+2*g), ss) | otherwise = (ss, g*(2*f-g)) where ss = f*f+g*g foldl_ = foldl' -- '
gollark: 3.1 Using 2x2 matricesThe argument of iterateabove is a linear transformation, so we can represent it as matrix and compute the nth power of this matrix with O(log n) multiplications and additions.For example, using the simple matrix implementation in Prelude extensions,fib n = head (apply (Matrix [[0,1], [1,1]] ^ n) [0,1])

References

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.